Lаmpоrts_ME_Algоrithm The cоntext for this question is the sаme аs the previous question. Consider a distributed system with 4 process nodes (P1, P2, P3 and P4) implementing a distributed Lamport’s mutual exclusion algorithm. d) Analyze the message complexity of the algorithm after the last improvement in the following scenarios: Low contention: Only one node ever requests a lock at any given time. High contention: All N nodes actively request to acquire locks. How many messages are required in each case in terms of N? No credit without justification.