NB: answer both 1 & 2, please 1) ...

NB: answer both 1 & 2, please 1) Typical BFS on an undirected graph runs until all the vertices are explored. However, if we want to stop when we reach our destination, we need to modify the BFS algorithm. Modify the BFS algorithm in such a way that the algorithm will stop whenever a path from a specific source to a destination is found. You also need to print the desired path. 2) Propose an algorithm based on depth-first search (DFS) to find the longest path between two vertices in an undirected graph. Analyze the time and space complexity of the proposed algorithm.