Q2.4 5 Points Many distributed algorithms require one process to act as coordinator, at least initially. If a process detects that the original coordinator is no longer responding to requests, it initiates a new election. Consider a group of 6 nodes labelled 0..5. Initially node 5 is the coordinator but it crashes. Node 2 is the first node to notice that the coordinator has crashed. Describe the election using: (i) the bully algorithm; (ii) the ring algorithm where the nodes are arranged in a logical ring and only communicate with their upstream neighbours. Your answer should define the types of messages exchanged between nodes. It should also clearly indicate all messages exchanged between nodes in the election process which node is elected as the new coordinator. Enter your answer here Please select file(s) Select file(s) Save