Consider the same Binary Search Tree What is the order in which the nodes are visited using BFS and DFS algorithms. A) BFS: 8,3,10,1,6,14,4,7,13 DFS:1,3,4,6,7,8,10,13,14 B) BFS: 4,7,13,1,6,14,3,10,8 DFS: 8,3,1,6,4,7,10,14,13 C) BFS: 4,7,13,1,6,14,3,10,8 DFS: 1,3,4,6,7,8,10,13,14 D) BFS: 8,3,10,1,6,14,4,7,13 DFS:8,3,1,6,4,7,10,14,13 E) None of the above are correct