just letters c,d,e,f

1. Develop a solution for the following line balancing problem, allowing a cycle time of 5 minutes. Task Time Task Work Task (seconds) Predecessor(s) A 70 B 60 120 B D 60 E 240 C D F 100 A G 190 E, F a. Draw the precedence diagram for the set of tasks. b. Calculate the theoretical minimum number of workstations. c. Balance this line using the longest task time heuristic. d. What tasks are assigned to which stations? e. Does the solution have the minimum number of stations? Explain. f. How much idle time is there, summed over all workstations? g. What is the efficiency of this line