Please anser questions attached, I dont need explanations.

The following six jobs are to be scheduled on a single machine:

Job	1	2	3	4	5	6
Processing time (min.)	100	130	210	70	150	110

1. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number.

Job	Flow Time (min)
1
2
3
4
5
6

1. What are the Makespan in minutes?

2. what are the Average flow time in minutes?

3. In what order would the jobs be processed using the SPT rule? What is the SPT sequence?

4. Compute the average flow time after each job is completed. Round your answer to the nearest whole number.

(Average flow time in minutes)

5. Compare this answer with your answer in question 2. Does the SPT rule or numerical order minimizes flow time and gets the most work done in the least amount of time?