The first known correct implementation of mutual exclusion for n processes, is the Eisenberg and McGuire algorithm described at https://en.wikipedia.org/wiki/Eisenberg_&_McGuire_algorithm. In reference to that algorithm, and assuming that n=5 and that turn = 2, answer the following questions and provide adequate explanations based on the algorithm description: a. Does the algorithm use busy waiting? b. If the critical section is not in use, is it possible for process P1 to be the next process to enter the critical section (assuming it asks for it)? c. If the critical section is in use, which process is using it? d. If the critical section is in use, and two processes P0 and P4 are waiting to enter it, in what order will they enter? e. If the critical section is in use, and two processes (say P0 and P1) are waiting to enter it repeatedly (i.e., once done with it, they will loop back immediately and attempt to enter it again), is it possible that one of these processes will be able to grab the critical section more than once before the other gets it? If yes, show how, and if not, explain why not. State any assumptions.