QUESTIONS 1. Explain the Round-Robin Scheduling algorithm with examples. 2. Explain the running state of a process in Operating Systems 3. Process PI P2 P3 P4 PS Burst Time 10 1 2 1 5 Priority 3 1 3 4 2 Processes arrives in order of P1, P2, P3, P4 and P5 at the same time of O(zero). For FCFS, SJF and non-preemptive priority algorithm a) Find the waiting times for each process. b) Find the average waiting times. c) Draw the Gantt charts