This is a fill-in-the-blank question. Given the following information Job Workcenter Machine Hours Due date (hours) 1 2 A/3, B/2, C/2 C/2, A/4 24 16 3 B/6, A/1, C/3 32 4 C/4, A/1, B/2 24 Use a Gantt chart to schedule the jobs in order 1, 2, 3, 4 and assume that jobs cannot be split. Assume it takes one hour to move the job between machines. (a) What is the makespan? Enter your answer (enter an integer only): (b) What is the idle time for Machine C out of the makespan? Enter your answer (enter an integer only): (c) Which job is late compared to the due date? A. 1 B. 2 C. 3 D. 4 E. None of above Enter your answer (enter an UPPERCASE letter): (d) Assuming finite capacity scheduling (FCS), that is, there are two machines of type A, two of type B, and two of type C. If it still takes one hour to move the job between machines, what is the makespan? Enter your answer (enter an integer only); (e) Now the order is no longer 1, 2, 3, 4. Using the shortest processing time (SPT), which one can be the correct sequence? A. 2-3-4-1 B. 2-1-4-3 C. 1-4-3-2 D 3-4-1-2 Enter your answer (enter an UPPERCASE letter)