Consider the following simple method to enforce mutual exclusion: All sites are arranged in a logical ring fashion and a unique token circulates around the ring hopping from a site to another site. When a site needs to executes its CS, it waits for the token, grabs the token, executes the CS, and then dispatches the token to the next site on the ring. If a site does not nned the token on its arrival, it immediately dispatches the token to the next site (in zero time).
(i) What is the reponse time when the load is low?
(ii) What is the reponse time when the load is heavy?
Assume there are N sites, the message/token delay is T, and CS axecution time is E.