(Assembly line balancing problem) An assembly line is being designed for manufacturing a discrete part. There are operations numbered 1 to 7 to be performed on each part. Each operation can be started on a part any time after all its immediate predecessor operations given in ti following table are completed, but not before. The table also gives the time it ta an operator to carry out each operation, in seconds. The cycle time of the assem line will be 20 seconds (i.e., each operator will have up to 20 seconds to work on part before it has to be put back on the line). An operator on the assembly line c be assigned to carry out any subset of operations, as long as the work can be completed within the cycle time and the assignments do not violate the precedenc constraints among the operations. It is required to determine the assignments of operations to operators on this line, so as to minimize the number of operators needed Formulate this as an integer program. Assume that we know that at most 4 operators are needed to complete the operations. Operation Immediate predecessors Time in seconds 1 7 2 9 3 1, 2 6 4 1 4 5 3 8 6 4 7 7 5,6 5 (Hint: Consider a dummy operation with processing time of 0, which needs to be completed as the last operation. Then try to minimize the index of the operator (workstation to which the dummy operation is assigned.)