Process BurstTime

P$110$

P$21$

P$32$

P$41$

P$55$ processes arrives in order of p$1,$p$2,$p$3,$ p$4$ and p$5$ at the same time of $0($zero$).$For the first time 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 grantt charts.