a. Find the optimal sequence for the following 1|| Ew,T; problem: Jobs 1 2 3 4 5 6. 7 Pi 6. 18 12 10 10 17 16 Wi 1 5 2 4 1 4 d; 8. 42 44 24 90 85 68 b. For the above problem, what is the optimal schedule if there are two identical machines? c. In applying Lagrangian relaxation to parallel machine scheduling problems, what will happen when ALL the parts are identical, i.e., have the same processing time and the same due date? Examine the problem from both the primal aspect and the dual aspect. What can be done to improve algorithm performance?