Code Question 2

Problem Statement

Several processes are scheduled for execution on an AWS server. On one server, n processes are scheduled where the i th process is assigned a priority of priority[i] . The processes are placed sequentially in a queue and are numbered 1, 2, ..., n . The server schedules the processes per the following algorithm: It finds the maximum priority shared by at least 2 processes. Let that be denoted by p . 1. If there is no such priority or p = 0 , the algorithm is terminated. Otherwise, select the two of the processes with the lowest indexes and priority p , call them process1 and process2 . The server executes process1 and removes it from the queue. To avoid starvation, it reduces the priority of process2 to floor(p/2) . Start again from step 1. Given the initial priority of the processes, find the final priority of the processes which remain after the algorithm terminates. Note that relative the arrangement of remaining processes in the queue remains the same, only their priorities change.