Lаmpоrt’s ME Algоrithm The cоntext for this question is the sаme аs the previous question. [6 points] Consider a distributed system with 3 nodes (P1, P2, P3) implementing Lamport's mutual exclusion algorithm, as shown in the Figure. The boxes represent requests made by a node at a particular timestamp. For example, P1,4 represents a request for the resource made by node P1 at timestamp 4. The red arrows represent requests, and green arrows represent the corresponding acknowledgment messages. c) [2 points] Suggest a simple method to prevent the algorithm from failing due to message loss.