Below is a six node search tree with one goal node. DFS and BFS take the same amount of time to find the goal. O O O O a) Draw a six node search tree where DFS finds the goal in the minimum number of steps (so some nodes will be unvisited), but BFS must visit every node. G b) Draw a six node search tree where BFS finds the goal in the minimum number of steps (so some nodes will be unvisited), but DFS must visit every node. c) Draw a six node search tree with positive integer cost-labeled arcs where UCS finds the goal in the minimum number of steps (so some nodes will be unvisited), but both DFS and BFS must visit every node.