Q5 a) Use Dijkstra's algorithm to find all the shortest paths from vertex A in the connected weighted graph shown in Figure 1. Show all the shortest paths found in a table according to the order found. Verify the correctness of all the shortest paths and draw a conclusion on the correctness of applying Dijkstra's algorithm to a graph with negative weights from the verification. B 3 A -2 2 Figure 1. A connected weighted graph with three vertices