Find the shortest path from node 1 to node 6 for the follow.g network by using the Dijkstra's algorithm. 3 N 2 2 3 3 Show all your calculations and clearly indicate the shortest path on the network on the answer sheet. Make sure to obey the following You are required to use the symbology discussed in the lectures for applying the Dijsktra's algorithm. Otherwise, you are to follow the algorithm step by step. Clearly indicate how you include an arc in the critical path. Fill in the answers to the appropriate places: The shortest path(s): Length of the shortest path from node 1 to node 6