[2 pts] Consider a state space where the start state is number 1 and the successor function for state n returns two states, numbers 2n and 2nt1 Draw the portion of the state space for states 1 to 15 (1 pt) Suppose the goal state is 11. List the order in which nodes will be visited for depth-limited search with limit 3 (0.5 pt), and iterative deepening search. (0.5 pt) [2 pts] Consider a state space where the start state is number 1 and the successor function for state n returns two states, numbers 2n and 2nt1 Draw the portion of the state space for states 1 to 15 (1 pt) Suppose the goal state is 11. List the order in which nodes will be visited for depth-limited search with limit 3 (0.5 pt), and iterative deepening search. (0.5 pt)