$9\mathrm{.}1.$ Consider the following workload: $($Do not include nonpreemptive in problem$)$

a$.$ Show the schedule using shortest remaining time,

and round robin with quantum $30ms.$ Use time scale diagram

as shown below for the FCFS example to show the schedule for each requested scheduling

policy.

Example for FCFS $(1$ unit $=10ms$ :

b$.$ What is the average waiting time of the above scheduling policies?