Consider a network with 6 nodes: A, B, C, D, E, and F. We consider D as the destination. round 5 0 1 A E 13 B 10 8 B Figure 2 a) Using the Bellman-Ford algorithm (SBF), compute the routes to D. The initial distance estimation of all nodes except D is co. 3 C 4 E A 00 2 F D b) A serious problem of distance vector algorithms is the count-to-infinite problem. What is count-to-infinite problem? Can count-to-infinite happen to the network in Figure 2? If so, please indicate the event (i.e., link status change); if no, please state why.