Every Halloween, the sisters of Alpha Delta Pi (ADP) put together ‘Monster Bags for children at the local hospital. Each Monster Bag consists of a paper bag stuffed with candy Each bag has a character’s face drawn on it with yam hair and paper arms and legs attached For the past few years, several sisters have worked individually. putting together bags on their own But because some of the women are much better artists than ethers the quality of the Monster Bags has varied greatly. ADP has been thinking about this problem They realize that making each bag really consists of several steps as listed in the following table They decide that ideal solution would be to develop a little production line to make the bags. This way the most talented artists can focus on what they do test – drawing the characters’ faces. They also developed the time estimates and predecessor data for the tasks, which are also provided in the table. ADP needs to make 218 bags Getting volunteers to help wouldn’t be a problem it they could get all the bags done in four hours. The cycle time is seconds. The theoretical number of workstations is Enter the missing positional weights in the table above. Using neatest positional weight and a the breaks’ rule of the most number of following tasks, the task assignments for each work stations are as follows (in the order they are assigned based on the rules given): WS#1. WS#2. WS#3. WS#4 The actual cycle time is seconds The efficiency for this assembly line is percent. If you assign A C, and B to WS # 1 enter your response as A-C-B with no spaces between. There might be extra work station(s). If no task is left to be assigned to an empty station enter none No decimal. Round to the nearest integer.