Chapter 5: CPU Scheduling

Consider the following table.
Four processes are arrived at time 0, with the length of the CPU burst given in milliseconds:

Process           Burst Time        Priority
P1                        15                   3
P2                        10                   1
P3                         3                    3
P4                         5                    2

*smaller priority number implies a higher priority
Table 1 List of processes that are arrived at time 0

The processes are assumed to have arrives in order P1, P2, P3, P4 all at time 0.
Draw four (4) Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, Priority, and RR (quantum = 5).