Given the following tree: Directions:Assume that you start…

Given the following tree: Directions:Assume that you start at the green node and the goal is to get to the yellow node. List the order of nodes that would be visited in a breadth-first search (5 points) List the order of nodes that would be visited in a depth-first search (5 points) List the order of nodes that would be visited in a depth-limit search where the limit is 2 levels (5 points) Compared to depth-first search, when is breadth-first search better at locating the goal? Are you guaranteed to find a solution if one exists using a depth-limit search?  (5 points)