1.2. Consider a state space where the start state is number 1 and the successor function for state n returns two state, number 2n and 2n+1. a) Suppose the goal state is 11. List the order in which nodes will be visited for (1) breadth-first search, (2) depth-limited search with limit 3, and (3) iterative deepening search. b) Call the action going from k to 2k Left, and the action going to 2k+1 Right. Find an algorithm that outputs the solution to this problem without any search at all