5. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: The processes are assumed to have arrived as it shown in the table. a. Using the presented time axis draw Gantt chart that illustrates the execution of these processes using a nonpreemptive SJF (the shortest-job-first) scheduling [1.5 credits]. What is the waiting time of each process for the scheduling algorithms in part (a) and what is the average waiting time? [ 1.5 credits]