$4.$ Given the following information:

Draw a timeline for each of the following scheduling algorithms.

a$)$ FCFS

b$)$ SJN

c$)$ SRT

d$)$ Round Robin $($using a time quantum of $2,$ ignore context switching and natural

wait$)$

Also compute the average turnaround time for each of the scheduling algorithms and

determine which one gives the best result.