1. (5 points) Do problem 5.6 from the text on page 119 which reads: "Modify the global-state recording algorithm to record global-state in a non-FIFO communication environment. State any assumptions that you make."

2. (5 points)  Do problem 5.7 from the text on page 119 which reads: "Consider a distributed system where each node has its own clock. Assume that all the clocks in the system are prefectly synchronized. Also, assume that the communication network is reliable. Give an algorithm for recording the global state. Note that your algorithm should be simpler than the Chandy-Lamport algorithm."