$\backslash$table$[[$Process$,$BurstTime$],[$P$1,10],[$P$2,1],[$P$3,2],[$P$4,1],[$P$5,5]]$

Processes arrives in order of $P1,P2,P3,P4$ and $P5$ at the same time of $0($zero$).$ For First Come First Serve $($FCFS$)$ and Shortest Job First $($SJF$)$ algorithms.

a$)$ Find the waiting times for each process.

b$)$ Find the average waiting times.

c$)$ Draw the Gantt charts.