State the iterative steps of Centralized Bellman-ford Algorithm. [2 pt] consider the following network topology with link-costs written by each link. 1 Iteration # 1 2 3 2 5 1 2 4 4 2 (next hop, cost) 3 5 1 Find the min-cost tree for destination node-2. Show the execution of BF algorithm using the following table format. [6 pt] N-1 ****** 6 ****** N-6 Draw the min-cost tree found in . [2 pt] After the min-cost tree is created, consider that the link 2-4 is broken. Show how the BF algorithm converges to a new min-cost tree to destination node-2. Use the same table format as in . [4 pt] Draw the min-cost tree found in . [2 pt]