$($c$)$ Consider the following set of processes:

$($c$1)$ Draw Gantt charts illustrating the execution of these processes using the

following algorithms.

First Come First Serve $(3$ points$)$

Shortest Remaining Time First $($Preemptive$)(4$ points$)$

Round$-$Robin $($quantum $=20$ points$)$

$($c$2)$ Based on your work above, fill in the table below giving both the waiting

time and finish time for each process $(12$ points$)$

Waiting Time

Finish Time