1. Prove by contradiction that ME2 is satisfied by mutual exclusion algorithm given by Ricart and Agrawala (1981).

2. Compare between Lamort's and Ricart and Agrawala's algorithm in terms of Equal Responsibility Rule, Equal Effort Rule, and number of messages per access to resource.

3. Consider a system with 10 processes. Process p3 sends a message to access critical resource. It receives replies from everyone except p3, p5, and p6. What can we say about processes p3, p5, and p6?

I have these questions only no more information.