1- Based on the graph above, please find the paths from A to F using the three algorithms below.
a. Breadth-First Search
b. Depth First Search
c. Dijkstra’s Shortest Path Algorithm
2- The weights will be used only for the Dijkstra algorithm. Follow the proper tabular format for writing the shortest distances with vertices.

1 Based on the graph above please find the paths from A to F using the three algorithms below a BreadthFirst Search b Depth First Search c Dijkstras Shortest Pa class=