Dijkstra's algorithm is commonly used to solve the shortest path problem in map navigation. Answer the following on Dijkstra's algorithm. (14 marks) 1. Suppose we have a map M as shown below. Write down the steps of finding the distances from E to all nodes at each iteration of the algorithm. Place your answer in the answer sheet. (10 marks) 2. Draw the shortest path tree of M. (4 marks)