(8) Dijkstra's algorithm is commonly used to solve the shortest path problem in map [30] navigation. Answer the following on Dijkstra's algorithm. (a) Suppose we have a map network M as shown below. Complete the table network to 10 show the distance values from A to all nodes at each iteration of the algorithm (Place your answer in the answer booklet). (b) Draw the shortest path tree of M. 5 (c) Dijkstra's algorithm does not work when a network has negative edges. Explain why. 5' (d) Suppose the network M has only one negative edge. Develop a method to find the 10 shortest path from A to all other nodes in M. (Hint: the method can be developed based on Dijkstra's algorithm)