6 jobs must be processed through the same machine center and they are labeled as A, B, C, D, E and F according to the order they entered the system. Assume the current time is 1:00 P.M. The following table shows the processing times and due dates for each job. a) Determine the sequences and compute mean flow time, average tardiness, maximum lateness, and the number of tardy jobs for (i) FCFS (ii) SPT (iii) EDD (iv) CR (v) Moore's Algorithm b) Which sequence you found in (a) would you use to satisfy the following objectives? (i) Minimize mean flow time (ii) Minimize average tardiness (iii) Minimize max lateness (iv) Minimize the number of tardy jobs Question 2: There are 3 jobs waiting to be processed in different machines with different machine routes. The table below shows the processing times and machine routes for each job. Apply Giffler and Thompson's algorithm to construct a schedule, then draw a Gantt Chart and determine the makespan