Find the shortest path between node 0 and node 6 in the graph in Figure 6. (a) Please solve it by using Bellman-Ford algorithm. (Note: If you only write down the path and length, you will get 0 points) (10%) (b) Explain why Dijkstra's algorithm doesn't work properly in this case. (5%) 0 6 5 5 1 H6 2 3 -2 -1 1 -1 Figure 6 4 5 3 3 6