5. Consider the assembly line balancing problem below: Task Time required (minutes) 12 Immediate Predecessors 1 2 3 15 8 1,2 2 4 9 a. Formulate the line balancing problem making use of the first formulation from the article E.H. Bowman, Assembly-line balancing by Linear Programming, Operations Research, Vol 8, pp. 385389, 1960). Assume a cycle time of 23 minutes. Illustrate all the decision variables and the MP formulation in detail. b. How many stations are sufficient for the problem solved according to the formulation in part- (a). Use a mixed integer programming software to determine the solution of this problem. Illustrate all the values of the significant decision variables and clearly state which task will be assigned to which station. c. Suppose that the precedence relations of the line balancing problem is ignored, how many stations will be sufficient. Note that before resolving the problem with the software used in part-(b) you should revise the formulation given in part-a)