Source Destination Cost Node Node For the graph G(V,E), where V-A, B, C, D, E, F,G,HI, and the set E shown above answer the following questions: Determine the path created using the depth first search (DFS) starting from vertex B to vertex Using the Dijkstra's algorithm on the above graph to find the minimum-weight paths from vertex A to all other vertices. Reconstruct the path from vertex A to vertex I and give the total cost of the path. a. b