Q4. You are given the following weighted graph, and you have to find the shortest path in the graph from A to H using the fastest possible algorithm.
D
2
2
1
a) Which of the three algorithms studied in class, Dijkstra, Shortest-path-DAG, or Bellman-Ford, would be most appropriate for this graph?
b) What is the running time of this algorithm in terms of the number of vertices V and edges E?
c) Use the algorithm of part (a) to find the shortest path from A to H. After each iteration, show the d[v] and (v) values for the vertices.