(choose one answer) In the following graphs, assume that if there is ever a choice amongst multiple nodes, both the BFS and DFS algorithms will choose the leftmost node first visiting. Starting from the green node at the top, which algorithm will visit the least number of nodes before visiting the goal node F from starting node A? a. BFS b. DFS c. Neither BFS nor DFS will ever encounter the goal node in this graph d. BFS and DFS encounter same number of nodes before encounter the goal node 4. (2 points) (fill the gaps) From the above tree, write down the visited nodes for BFS and DFS a. BFS (answer):_________________ b. DFS (answer):_________________

A B c D E G H 1 (1) K L M)