Please help will give thumbs up thank you.

DO NOT COPY FROM OTHER CHEGG QUESTIONS PLEASE. This is a different question

]

Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. (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 =10 ). (b) Compute the average wait time in each of the scheduling algorithms in part (a)