Apply Dijkstra's least-cost or shorted path algorithm to N2 of the above network. Complete the table below by filling alto to show the result of al When completed lal For a path, you must write like 2-5-3 with no spaces for full credits