Operating system question.

The table below is a set of processes:

Assuming a uniprocessor and that all processes arrive at time 0:

(a) Draw the Gantt chart for a schedule that will minimize average turn-around time. (use SJF)

(b) Draw the Gantt chart for a schedule that will minimize average waiting time. (use SJF)

(c) Draw the Gantt chart for a schedule that will minimize the maximum tardiness and then, if possible, the average turn-around time. (use Smith's algorithm)

P2 P3 P4 P5 P6 P7 P8 10 12 6 1 8 4 5 Process P1 Processing 3 time Due Time 4 15 10 9 42 30 12 35