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 everyT time units and decides the next process to schedule. Which one of the following is TRUE if theprocesses have no I/O operations and all arrive at time zero?

1. This algorithm is equivalent to the first-come-first-serve algorithm.

2. This algorithm is equivalent to the round-robin algorithm.

3. This algorithm is equivalent to the shortest-job-first algorithm.

4. This algorithm is equivalent to the shortest-remaining-time-first algorithm.