Need help plz

lart I Assume that the ready queue has just received for processes: P1, P2, Ps, P, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Pi P2 PS PM Execution Time (in ms) 12 15 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)