2. Consider the network of Figure 5-6(a) (4th and 5th editions) and suppose that we use flooding as the routing algorithm. We will stop the flooding by imposing a maximum hop count on the packets. a) If a packet sent by B to N has a maximum hop count of 3, list all the routes that it will take. Consider all routes, even ones which do not end at N. Also, draw a tree showing how your routes were determined. b) How many packet-hops worth of bandwidth does it consume? (1 packet which travels over 1 hop uses 1 packet-hop of bandwidth.)