Consider the following job times for a three-machine problem. Assume that the jobs are processed in the sequence A-B-C. Using Johnson's scheduling rule answer the following questions: Job Machine Machine B Machine A C J1 6 5 8 J2 9 6 10 J3 8 2 6 J4 5 3 7 J5 4 5 11 a) What is the optimal sequence? (10 pts.) b) What is the makespan? (2 pts.) c) What is the waiting time for each job? (4 pts.) d) What is the waiting time for each machine? (4 pts.) e) Draw the Gantt chart for the optimal schedule. (10 pts.)