In the following graphs, assume that if there is ever a choice amongst multiple nodes, both the Breadth-first search (BFS) and Depth-first search (DFS) algorithms will choose the left-most node first. Starting from the green node at the top. Show the path of the travel in this graph by DFS and BFS algorithms and then which of theses algorithms will visit the least number of nodes before visiting the yellow goal node