1. Consider the following set of processes, with the length of the CPU burst given in milliseconds a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: Priority Scheduling algorithm and Round-Robin scheduling algorithm (quantum =3 ). b) What is the waiting time of each process for each of the scheduling algorithms? c) Which of the algorithms produce results in the minimum average waiting time (over all processes)? (CLO 2.3) 2. Considering a system with five processes P0 through P4 and three resources of type A, B, C. Resource type A has 10 instances, B has 5 instances and type C has 7 instances. Suppose at time t0 following snapshot of the system has been taken: (CLO 2.5)