Gant chart for round robin scheduling (Assume that the time quantum is 4 time units) also assume that if a new process arrives at exactly the same time as the time slice of the executing process.

Analyze scheduling algorithms for the following five processes given the process CPU burst time, priority (lower number means higher priority) and arrival time. Arrival Processes Burst Time Priority Time P2 P4 For each of the following scheduling algorithms draw a Gantt diagram Calculate the total Wait time for each process, and calculate the average wait time