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?

Explanation

Since every process starts at the same lowest priority and priority grows purely with waiting time, the process that has waited longest is always chosen next; after running for exactly T units it is preempted at the next re-evaluation point and, having just run, drops back to the bottom relative to the others, letting the next-longest-waiting process take its turn. The net effect is that every ready process cycles through getting a fixed T-length turn in rotation — which is exactly how Round Robin scheduling with time quantum T behaves, option (ii), even though it is dressed up here as an aging-based priority scheme.