10 Jul Part 1: In a two-phase, total-order multicast system, messages ar

Part 1: In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group.S sends m1 to G1S sends m1 to G2S sends m2 to G2S sends m2 to G1Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport’s clock.  In which order and at what times are m1 and m2 delivered?Part 2. Draw a state diagram of Maekawa’s voting algorithm on the slide “Maekawa’s algorithm” in the “Distributed mutual exclusion” slide set. Note that the state diagram is from the point of view of any one of the nodes, called ‘this’ node below. The state diagram cannot show the states of other nodes.i) Start with the basic case where ‘this’ node wants the lock, gets it, and then releases it, and no other node wants the lock at the same time. In this case, ‘this’ node goes through all the states in this order:Released and not votedWanted and not votedWanted and votedHeld and votedReleased and voted(Back to) Released and not votedEvents are:acquire for when “this” node wants the lockrelease for when “thi