$4[40$ points$]$ CPU Scheduling

$4\mathrm{.}1(20$ points$)$ Consider the following single$-$thread process, arrival times, and CPU

process requirements:

We consider $4$ algorithms: FCFS$,$ RR$,$ SJF$,$ SRTF$.$

The time quantum of the Round$-$Robin $($RR$)$ is $4.$

Assume that context switch overhead is $0.$

When a process arrives, it is immediately eligible for scheduling, e$.$g$.,$

process $2$ that arrives at time $2$ can be scheduled during time unit $2.$

Whenever there is a tie among processors $($same arrival time, same

remaining time, etc$),$ they are inserted into the ready queue in the

ascending order of process id$.$ That is$,$ if process $1$ and process $2$ arrive at

the same time, process $1$ is inserted first, and process $2$ second in the ready

queue.

For each scheduling algorithm, draw the Gantt charts depicting the sequence of the

process execution, and calculate the average turnaround time.