Assume that PA, PB and PC are three programs. When PA is executed, it needs 8 ticks to complete its execution and it forks new processes executing PB at tick-marks 2 and 4. Similarly, PB needs 6 ticks to complete its execution and it forks new processes executing PC at tick-marks 2; and PC needs 4 ticks to complete its execution. Assume that 3 process {P1, P2, P3} have arrived before t=0, and P1 and P2 are executing PA while P3 is executing program PB. Required:
Draw a Gantt chart illustrating the scheduling of these processes if a SRTF scheduling is used.