QUESTION $3$: You were given four processes with their arrival time and execution time for each in the table.

Process

Arrival time

Execution time

Processes A

$0$

$4$

Processes B

$2$

$3$

Processes C

$3$

$4$

Processes D

$5$

$5$

Develop the schedule $($time diagram$)$ for the following methods.

First$-$Come$-$First$-$Served $($FCFS$)$

Round Robin

Shortest Process Next $($SPN$)$

Assume the length of the time quantum, or slice is $1($q$=1)$