Set up a table, in the format illustrated in the Solved Problem 2, pp.198-199 in the textbook, with columns titled "Workstations", "Candidates", "Choice", "Cumulative Time", and "Idle Time". Assign work elements into workstations, one element at a time using the longest-work-element-time rule, while keeping an eye on the "idle time" and the precedence relationships in the diagram.

(Note: cross off the work elements in the diagram as they are assigned into workstations, so that you may have clarity in knowing which work elements are candidates at each step.)

Calculate the efficiency based on the "actual number of workstations" you'd obtain. Show your work.

Given the work element times shown in the following table, what is the theoretical minimum number of workstations? Round your answer UP to the nearest whole number. Given the work element times shown in the following table, what is the theoretical minimum number of workstations? Round your answer UP to the nearest whole number