A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

• A. This algorithm is equivalent to the first-come-first-serve algorithm
• B. This algorithm is equivalent to the round-robin algorithm
• C. This algorithm is equivalent to the shortest-job-first algorithm..
• D. This algorithm is equivalent to the shortest-remaining-time-first algorithm