A manager wants to assign tasks to workstations to achieve an hourly output rate of 29 units. Assume that the shop works 60 minutes per hour (i.e., no breaks). 1.11 .15 f 1.76 .61 .81 b d .33 h 1.64 1.28 g a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: "Assign the task with the longest time." (Round the intermediate calculations and final answers to 2 decimal places.) Workstations Task 1 a, b 2 b, e 3 f, g, c 4 9. h Idle Time f 1.76 .61 .81 b d .33 h 1.64 1.28 g a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: "Assign the task with the longest time." (Round the intermediate calculations and final answers to 2 decimal places.) Workstations Task 1 a, b 2 b, e 3 f, g, c 4 9. h Idle Time b. What is the efficiency? (Round the intermediate calculations to 2 decimal places. Round the final answer to 1 decimal place.) Efficiency 1%