A scheduling algorithm assigns a process's priority proportional to how long it has been waiting; every process starts at priority zero (the lowest), and the scheduler re-evaluates all priorities and picks the next process to run every T time units. If no process performs I/O and all arrive at time zero, which classical scheduling discipline does this scheme effectively implement?

1. A(A) Priority scheduling
2. B(B) Round Robin scheduling
3. C(C) Shortest Job First
4. D(D) FCFS

Pick an option to check yourself, or open the answer below.