3. [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 2n+1 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) Figure 1 Set all nodes to "not visited"; q = new Queue(); q.enqueue(initial node); while (q empty)do xq.dequeue) if (x has not been visited) visited[x]-true // Visit node x! for ( every edge (x, y) /* we are using all edges ! */ ) if (y has not been visited) q.enqueue(y) // Use the edge (x,y) !!! Figure 2: Breath First Search (BFS)