Please, I want to solve all paragraphs with the correct and clear solution. The solution should be textual with correctly drawn Gantt chart. Please solve each paragraph separately. I want clear answers for each paragraph with all the steps.

Course with code

COMP-333 Operating System

Section

Please I don't want a previous solution from chegg

1. Consider the following set of processes, with the length of the CPU burst givent in milliseconds. a). Draw Gantt charts that illustrate the exccution of these processts using the following scheduling aleorithns: Priority Scheduling alporithm and Round-Robin scheduling algorithm (quartum-5). b). What is the waiting time of each process for cach of the seheduling algorithms? c). Which of the algorithuns produce results in the minimum average waiting time (over all processes)? 2. Consadering a system with five processes P0 through P4 and three resources of type A, B. C. Resource type A bas 7 instances, B has 10 instances and type C has 4 instances. Suppose at time to following snapsbot of the system has been taken Questionl. What will be the coinent of the Need matrix? Question2. Is the system in a affe sate? If Yes, then what is the safe sequence? 3. Consider the following set of processes, with the knggh of the CPU burst given in a) Draw four Gant Charts that illustrate the execution of these peecesses using the following scheduling algorithms: FCFS, SJF Nen Precmptive, SJF Precnptive. b) What is the waiting time of each process for each of the scheduling algorithms in part a? c) Which of the algorithms produce results in the minimum average waiting time (Overall processes)