For the following graph: - write a program to search/traverse through a graph using either Breadth-First Search (BFS) or Depth-First Search (DFS) algorithms. Ask the user to choose start/source and destination vertices. - write a program to find the minimum spanning tree, using either Kruskal or Prim algorithms. Calculate the time for your method. Lab \#6 - For the following given graph and a source vertex in the graph, find the shortest paths from the source to all vertices (1-M) in the given graph using either greedy strategy (Dijkstra's algorithm) or dynamic programming (Bellman-Ford Algorithm). Calculate the time for your method