For the given six process apply preemptive priority scheduling technique. Design the execution schedule of these processes (timing diagram). PROCESS CPU Arrival time burst Priority (round to integer) P1 0 5 P2 1 00 P3 4 3 P4 6 6 P5 7 4. P6 10 2. Priority is calculated as: Priority = 100/Burst_time Higher number means a higher priority. Round the priority to an integer value. Enter the priorities of these six processes into the table. Priority is calculated as: Priority = 100/Burst_time Higher number means a higher priority. Round the priority to an integer value. Enter the priorities of these six processes into the table. (a) Draw the timing diagram of processes' execution and calculate their waiting times and an Average waiting time (Tw), and Turnaround times and Average turnaround time (Ttr). (b) 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 and turn around times for all processes including the average waiting and turn around times