#7 Consider the network below, but ignore the weights on the lines. Suppose that it uses flooding as the routing algorithm. A packet sent by A to D has a maximum hop count of 3, list all the routes (paths) it will take Aso tel how many hops it consumes (A hop is moving from one router to another. 2 #7 Consider the network below, but ignore the weights on the lines. Suppose that it uses flooding as the routing algorithm. A packet sent by A to D has a maximum hop count of 3, list all the routes (paths) it will take Aso tel how many hops it consumes (A hop is moving from one router to another. 2