Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. Process: Arrival Time(ms): Burst Time(ms) P1: 0.000: 3 P2: 1.001: 6 P3: 4.001: 4 P4: 6.002: 2 Find the average turnaround time and waiting time for the given processes with Gantt chart. Use the algorithms as First-Come-First-Served, Shortest Job First, Shortest Remaining Time First, Round Robin (quantum = 2) and Round Robin (quantum = 1).