2.1 and 2.2 please

2. [50 points] Consider a set of intersecting rings as in the following figure Here, a small square represents a node, including nodes that can transfer packets between rings, and each ring has an arrow that indicates the di- rection of packet flow on that ring. Each ring is labeled by a lower case Greek letter with the first ring labeled 2.1. Display the adjacency matrix for the network in the figure. 2.2. Which, if any, nodes are equivalent on the network and why? (Hint recall that equivalence in this context has to do with the number of links to a node as well as the information flow directions to and from a node 2.3. Which nodes, if any, represent single points of failure of the network? 2.4. Display the weight matrix for the network 2.5. Using the Bellman-Ford algorithm, calculate a route from node S to node D on the network as displayed in Fig. 1. Show each step of the algorithm as you develop the route. Figure 1: A set of intersecting rings