Consider the following set of five processes, with the arrival times, CPU burst time (in milliseconds), and priority given. (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 3). (b) What is the waiting time and turnaround time of each process for each of the scheduling algorithms in part (a)? Which of the following scheduling algorithms could result in starvation: First-come, first-served, Shortest job first, Round robin, Priority? Justify. Consider the exponential average formula used to predict the length of the next CPU burst. What are the implications of assigning the following values to the parameters used by the algorithm? a. alpha = 0 and tau_0 = 100 milliseconds b. alpha = 0.99 and tau_0 = 10 milliseconds