Given the properties of BFS (Breadth First Search) and DFS (Depth First Search) algorithms, select the most suitable algorithm for each application: Find the shortest path between 2 nodes Cycle detection Strongly connected components detection Bipartite graphs A) BFS - DFS - DFS - BFS B) BFS - DFS - DFS - BFS C) BFS - BFS - DFS - DFS D) DFS - BFS - DFS - BFS E) None of the above