1. Run Dijkstra's algorithm on the following graph starting from v . Does Dijkstra's algorithm work correctly with graphs with negative weight edges? 2 3 V 2. Run Dijkstra's algorithm on the graph starting from A. a) List the nodes in the order of their removal from the queue. b) Fill table like the following table d[v] P[V] A 0 B C ID G I 8 B 7 1 2 6 D E F 9 3 9 8 H I 8