Draw the search trees result from performing both depth-first and breath-first search on the following graph when starting from vertex A. You may assume that edges are ordered alphabetically such that the edge (A, B) occurs before (A, F) or (C, F) occurs before (C, I). Using the following graph and Dijkstra's algorithm, calculate the shortest distance to each other vertex starting from vertex A. Label all vertices with the total distance (from A) and draw a Minimum Spanning Tree showing the shortest paths starting from A. You should label all nodes in the tree, do not need to indicate edge weights or total distance