(40 points) Two jobs ( 1 and 2) are to be processed through six machines (A, B, C, D, E, and F ). Job 1 must be processed in the order A,B,C,D,E, and F. Job 2 must be processed in the order A,C,E,B,D, and F. The times required for the six operations on the two jobs are as follows. Determine how the two jobs should be scheduled in order to minimize the makespan. Draw the Gantt chart that indicates the optimal schedule