Distributed Algorithm

Problem Set 3 Refer Lynch Textbook for the Problems Please submit solutions by April 21 st 3.2 a) and b) only Make sure the label the nodes with the information level that algorithm gives after each round. Graph: Complete undirected graph with 3 nodes. (i.e. n = 3) Nodes are labeled with 1, 2, and 3. Rounds: 4 (i.e. r = 4) "Good" Communication Pattern: (1,3,1), (2,3,1), (3,1,1), (2,3,2), (3,2,2), (3,1,3), (2,3,3), (2,3,4), (1,3,4), (3,2,4), (1,2,4)