4xWR b) A fair share scheduling algorithm has been implemented on several UNIX systems. It uses the following formulas for process j in group k: CPU;(i) = |CPU, C-), GCPU(i) = [GCPU(i=)) , P;(i) = Base; +[CPU, 0] (1) -1 GCPU (1) Suppose that we have processes A and B in the first group and process in the second group, with each group having a weighting W, = and W, = All processes have a base priority of 60, and the processor is interrupted 60 times per second. The processor usage field of the currently running process is incremented during each interrupt, as is the corresponding group processor field. Sketch and show the calculation of priorities and schedule for 3 seconds. (4 marks)