Suppose the following processes arrive for execution at the times indicated. Each will run for the amount of time shown. Determine the average wait time and the average turnaround time for the processes under each of the following scheduling algorithms: (a) FCFS (b) SJF without preemption. (c) SJF with preemption (Show all work - use the back of the page if you need to.) Show the Gantt chart for each algorithm