Using your favorite link-state algorithm, find the shortest paths and the costs for each node in the network (shown below) from the source node D. Please show each step of the iteration, the previous hop node, and the least cost in a tabular form. Only clear, step-wise demonstration of the algorithm execution will be awarded full credit. For the first row, please show the application of the equation.

7 4