Analytical Problems (10): 1. Consider the network in the figure below. Use the shortest path first principle according to Dijkstra's algorithm to compute the best route from A to all other nodes in the network. Your solution should show the steps taken in the execution of the algorithm, including cost and path to the destination. The table structure is given for your reference. M D. (path) D. (path) D (path) D. path) Ans: 2. Assume a network according to the figure below. Use the shortest path first principle according to Dijkstra's algorithm to compute the best route from A to all other nodes in the network. Your solution should show the steps taken in the execution of the algorithm B E