1. Uninformed Search

a. Consider a state space where the starting/initial state is labeled 1 (n=1 for the initial state), and the successor function for state n returns three states: 2n, 2n+1, 2n+3. Draw the search tree describing this state space for all states 1 to 11 (states may be repeated in the tree, but no states should have a number higher than 11).

b. Suppose the goal state is 6. Perform iterative deepening depth first search to solve the problem. For each iteration and step, clearly label the content of the frontier, the node being expanded, and the current arrangement of the search tree.