A system adopts a priority$-$obased preemptive scheduling and every prcess runs for $5ms,$ before the

dispatcher switches processes. In a recorded time span, the system has four processes, P$1,$ P$2,$ P$3$ and

P$4,$ as shown in the following table:

Draw a timing diagram as explained in class for the above processes. Assume that the dispatcher takes

$2\mathrm{.}5$ milliseconds for a process switch. Assume that the highest priority value is $0.$