Question IV (30 points) For the following graph, answer the question below: B F 8 4 8 H 3 10 E 3 6 12 A D What is the length of the shortest path to visit each node in the following graph starting from vertex A. Use Dijkstra's algorithm and show your work in the following table. S in the table is the set of vertices that have been processed by the algorithm, d(X) is the distance between vertex X and the starting vertex. Pi(x) is the predecessor vertex of X. S d(A), pi(A) (B), pi(B) d(C), pi(C) d(D), Pi(D) (E), PI(E) (F), Pi(F) (G), Pi(G) (H), Pi(H)