please answer within 20 mins.

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. B 2 E D 4 The table structure is given for your reference. M D(path) D. (path) D: (path) D. (path)