welve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight, and (2) most following tasks.In each case, the tiebreaker will be the shortest processing time.TaskLength (minutes)Immediate Predecessora0.1—b0.2ac0.9bd0.6ce0.1—f0.2d, eg0.4fh0.1gi0.2hj0.7ik0.3jl0.2k a. Draw the precedence diagram for this line.b. Assign tasks to stations under each of the two rules. c. Compute the percentage of idle time for each rulewelve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight, and (2) most following tasks.In each case, the tiebreaker will be the shortest processing time.TaskLength (minutes)Immediate Predecessora0.1—b0.2ac0.9bd0.6ce0.1—f0.2d, eg0.4fh0.1gi0.2hj0.7ik0.3jl0.2k a. Draw the precedence diagram for this line.b. Assign tasks to stations under each of the two rules. c. Compute the percentage of idle time for each rule