Consider a variation of round robin scheduling, say NRR scheduling. In NRR scheduling, each process can have its own time quantum, q. The value of q starts out at 40ms and decreases by 10ms each time it goes through the round robin queue, until it reaches a minimum of 10ms. Thus, long jobs get decreasingly shorter time slices. Analyze this scheduling algorithm for three jobs A, B, and C that arrive in the system having estimated burst times of 100ms, 120ms, and 60ms respectively. Also identify some advantages and disadvantages that are associated with this algorithm.