please I want to solve this question about AI

in detail when we do enQ and deQ until we reach the goal (yellow node) and why

- 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