Title: “Solving Search Problems with BFS and DFS Strategies”

Solve these 4 questions: Draw the search tree for the search problem using the BFS stra egy assuming that the Start state is [s] and the Goal state is [t]. 
What is the path returned from the BFS strategy? 
Draw the search tree for the search problem using the DFS strategy assuming that the Start state is [s] and the Goal state is [t]. 
What is the path returned from the DFS strategy?