The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU). Obtain the Gantt chart assuming Shortest Remaining Time First (preemptive) and using that specifying the process running in different time slots. Process Arrival time Burst time P1 O 3 P2 1 4. P3 2 3 1 4 P4 0-1 [Choose ] P4 P1 P2 P3 idle 1-2 2-3 [Choose ] 3-4 [Choose ] 4-5 [Choose ] 5-6 [Choose ] 6-7 [Choose ] 7-8 [Choose ] 8-9 [Choose ] 9-10 [Choose ] 10-11 [Choose ] 4