Table below shows the processes A, B, C and D with their arrival and service times. Process Arrival Time Service Time A 0 5 B 3 3 4 3 D 5 2 Draw a scheduling diagram and find the average waiting time for each of the scheduling algorithm below. (a) Shortest Remaining Time (b) Round Robin with time quantum =lms (c) Feedback with the following priority queue: Priority Queue Time Quantum RQ1 2ms RQ2 1ms RQ3 1ms