3. Producing widgets involves fourteen production tasks, lettered a through n, below. For each task, the time required to accomplish it is given, and the immediately preceding task. See table and precedence diagram below. Production Task Preceding Task a b a b d a e f Time (min.) .2 .4 .5 4 1.0 .5 1.1 .7 .8 .4 1.2 .9 .6 .4 n 1 k 1 e d, f g g h i k 1 j, m 0-0-0-G n a. Determine the theoretical minimum number of workstations and assign the tasks to workstations according to the heuristic rule of the largest number of following tasks. Use longest processing time as a tie-breaking rule, if needed. b. How many workstations are required under the rule of the largest number of following tasks? c. What is the percent of idle time (or the balance delay) for this layout? d. What is the efficiency of this layout? 3. Producing widgets involves fourteen production tasks, lettered a through n, below. For each task, the time required to accomplish it is given, and the immediately preceding task. See table and precedence diagram below. Production Task Preceding Task a b a b d a e f Time (min.) .2 .4 .5 4 1.0 .5 1.1 .7 .8 .4 1.2 .9 .6 .4 n 1 k 1 e d, f g g h i k 1 j, m 0-0-0-G n a. Determine the theoretical minimum number of workstations and assign the tasks to workstations according to the heuristic rule of the largest number of following tasks. Use longest processing time as a tie-breaking rule, if needed. b. How many workstations are required under the rule of the largest number of following tasks? c. What is the percent of idle time (or the balance delay) for this layout? d. What is the efficiency of this layout