(a) For the given six process apply non-preemptive priority scheduling technique. PROCESS CPU burst Priority (round to integer) Arrival time P1 5 P2 1 8. P3 4 3 4 6. 7 P5 7 4 P6 10 2 Priority is calculated as: 100 Priority urst _time Higher number means a higher priority. In the table, show the priorities of these six processes. Draw the timing diagram of processes' execution and calculate their waiting times and an average waiting time. (b) In the priority scheduling, the major problem is indefinite blocking or starvation. With one sentence explain what is starvation. In the case (a) indicate which process will starve? Apply aging technique to solve the starvation problem by gradually increasing the priority of processes waiting in the system. For the case under (a) increase the priorities of processes by 1 for every time unit waiting in the queue (For example for a process with priority 10 waiting in the queue 5 time units, the new priority will be 10+5=15). Show the execution of six processes by applying the aging technique, show how processes are aging in the waiting queue, and calculate new waiting times for all processes and the average waiting time.