(a) Use Dijkstra's algorithm to find a shortest path from node A to each of the other four nodes in the following directed graph, where the numbers by the arcs represent the distances. Provide the details of your working. In particular, provide the list of your updated labels for each of nodes B, C, D and E, starting with +00. What are the shortest path to each of these four nodes and the corresponding length? A 10 3 1 B C 3 8 7 9 2 E [50% ] (b) Consider a new directed graph that is the same as the one in part (a) except that there is no arc (C, B) and that the "distance" of arc (B, C) is equal to -8. Use the Label Correcting Algorithm to find a shortest path from node A to each of the other four nodes. Provide the same level of details as required in part (a).