Given the state space graph with an initial state S and a goal state G, answer the following questions. Note that the search algorithms end when the goal node is generated.

1. Draw a final search tree from the depth-first search and write the number of all expanded nodes throughout the search (do not include generated, but not expanded nodes). If you find multiple answers, provide only one of them.

2. Draw a final search tree from the breadth-first search and write the number of all expanded nodes throughout the search (do not include generated, but not expanded nodes). If you find multiple answers, provide only one of them.

3. Draw search trees from the iterative deepening search. Write the number of expanded nodes throughout the search (do not include generated, but not expanded nodes). The search tree and the number of expanded nodes should be elaborated for each depth limit. If you find multiple answers, provide only one of them.