PLEASE ANSWER ALL PARTS OF QUESTION

Consider a group of distributed processes, P1, P2, P3, and P4 that share an object. in the critical section (CS) and there is no other node in the wanted state. Now consider requests from Pl, P4, P2 an requests are also received in this order (P4, P2, P3). Choose your own voting sets. Clearly state them. Show the state (as required by the algorithm, i.e. held, wanted, etc.) and queue entries at each processor Consider a group of distributed processes, P1, P2, P3, and P4 that share an object. in the critical section (CS) and there is no other node in the wanted state. Now consider requests from Pl, P4, P2 an requests are also received in this order (P4, P2, P3). Choose your own voting sets. Clearly state them. Show the state (as required by the algorithm, i.e. held, wanted, etc.) and queue entries at each processor