All processes arrive in numerical order at time 0 with the following running times: P1 300ms, P2 50ms, P3 200ms. If the time-slice quantum is 50ms, show the scheduling order for these processes under FIFO (First-In-First-Out), SJF (Shortest-Job-First), and RR (Round-Robin) CPU scheduling algorithm. Draw Gantt chart for the 3 algorithms.