The kernel of an OS implements the HRN policy preemptively as follows: Every t seconds, response ratios of all processes are computed and the process with the highest response ratio is scheduled....

The kernel of an OS implements the HRN policy preemptively as follows: Every
t
seconds, response ratios of all processes are computed and the process with the highest response ratio is scheduled. Comment on this policy for large and small values of
t. Also, compare it with the following policies.

a. Shortest time to go (STG) policy.

b. Least completed next (LCN) policy.

c. Round-robin policy with time-slicing (RR).