Use Dijkstra$$s algorithm to find the shortest route between node $1$ and node $5,6,7$ in the network. Write the optimal path, alternative paths if any, and its length $($Express the Dijkstra$$s labeling procedure on each node$).$