A MLF algorithm uses $5$ priority levels. At level $5,$ a process executes for Q $=1$ ms$.$ At each of the lower levels the quantum is doubled $(2$Q$,4$Q$,8$Q$,16$Q$).$

The following processes are to be scheduled:

Process Arrival Total CPU time

p$101$

p$213$

p$3114$

After termination, process p$1$ blocks for $4$ ms and then reenters the queue again at level $5.$ Similarly, process p$2$ blocks for $5$ ms and then reenters the queue again at level $5$

a$)$ Draw a timing diagram for the first $33$ ms$.$ On each of the $3$ lines $($one per process$)$ show when the process is running and at which priority level.