here is the question in writing I hope this clarifies what's inside the photo

Q2

Consider the following process with the length of the CPU burst time given in milliseconds

The process are assumed to have arrived in order P1, P2, P3 and P4 all at time 0

A) draw the gust charts illustrating the escalation of these processes using

1) FCFS

2) None preemptive SJF

3) RR (quantum = 3ms

B) what is the average waiting time for each algorithm ( FCFS , SJF, and RR)

1) HCTS (1 s pari) 2) None Trempitive 531 (1. 5pts)