3. Run Dijkstra's algorithm on the following network, execute the algorithm on node "o" and compute shortest path N' from node O to every other node [10 Marks). 12 F 7 5 o B D G 3 2 4 E N' D(A) P(A) D(B), P(B) D(C), P(C) D(D), P(D) D(E), P(E) D(F), P(F) D(E), P(E) o 2,0 5,0 4,0 oo oo oo oo