Consider the following network: 5 2 3 2 5 E F m 7 (a) Execute Dijkstra's shortest path algorithm to find the shortest path from node B to all other nodes. (10 points) (b) Now suppose the link cost for one of the links changes but all costs remain non-negative. For each change in link cost listed below, state whether it is possible for the route at node B (i.e., the link used by B) for any destination to change, and if so, name the destination(s) whose routes may change. (12 points) (i) The cost of link(A, C) increases. (2 points) (ii) The cost of link(A,C) decreases. (2 points) (iii) The cost of link(B, C) increases. (6 points) (iv) The cost of link(B, C) decreases. (2 points)