a. Give an example of an execution of Algorithm 16.2 in which decisions occur in different rounds.
b. How much time can elapse in Algorithm 16.3 between a crash and its detection?
c. Prove the eventual perfection of Algorithm 16.4. Is the re lation mep J.t eventually satisfied in every execution?
Text Book: Introduction to Distributed Algorithms By Gerard Tel.