Execute the Dijkstra algorithm at node C for the network shown below by filling in the

following table. In the table, you need to give both the distance D$($v$)$ and the previous node

p$($v$).$