$4.$ Execute the Dijkstra algorithm at node B for the network shown below by filling in the following table. In the table, you need to give both the distance $\backslash ($ D$($v$)\backslash )$ and the previous node $\backslash ($ p$($v$)\backslash ).$