sove with details only

- In the following graphs, assume that if there is ever a choice amongst multiple nodes, both the BFS and DFSalgorithms will choose the left-most node first. Starting from the green node at the top, which algorithmwill visit the least number of nodes before visiting the yellow goal node? a. BFS b. DFS c. Neither BFS nor DFS will ever encounterthe goal node in this graph. d. BFS and DFS encounter same number ofnodes before encounter the goal node. Please choose your answer and explain why in details