In the topology below, the cost of traversing any link is 2. Enter -1 if the answer to any question is infinity. Unless stated otherwise, assume the following: nd. The routes use Bellman Ford algorithm without any optimization techniques 1. Suppose the cost of link C-D increased from 2 to 3. After the routing algorithm converged on the entire network, what is the distance from A to D? 2. Suppose the routing algorithm converged on the entire network, and the link C-D fails, how long does it take before A and B find out there is no way to reach D