pls help computer science question thank you

For problems (1) and (2) about graph search problems, note: 1) The initial state is considered to have depth o. 21 To say that a state s "checked" means here that we checked whether or not it is the goal state. (If it's not the goal state, it will be expanded next.) Suppose you run BFS on a search problem with branching factor 2, where the goal is at depth 5. What is the minimum number of states that would be checked before completing the search? Type the exact integer as your answer, with no extra text, no decimal places, etc. Answer: Suppose you run DFS on a search problem with branching factor 2, where the goal is at depth 5. What is the minimum number of states that would be checked before completing the search? Type the exact integer as your answer, with no extra text, no decimal places, etc