Problem 2 a. Use the Dijkstra's Algorithm to find the shortest-path between O-T on the following network, where the numbers represent actual distances between the corresponding nodes. 3 4 4 KG 4 4 5 2 2 2 7 2 6 2 5 8 H T 4 5 1 2 3 3 B E 6 5 b. Why does Dijkstra's shoethest path algorithm not work for graphs with negative weights, briefly explain (You can use a simple network)