1. (24 points) You are given the following processes with CPU-burst time, arrival time and priority (lower # means higher priority) For each of the following scheduling algorithm, show (using

the diagram as in the slides), how the process are being executed. Also calculate the average wait time. a. Shortest job first (non-preemptive) b. Shortest remaining job first (preemptive) c. Priority-based (preemptive, with round robin on process with same priority,quantum = 3, quantum only applied to processes that is involved in round robin). d. Priority-based (preemptive, with round robin on process with same priority,quantum = 5 quantum only applied to processes that is involved in round robin).