3.15 Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k and 2k+1. a. Draw the portion of the state space for states 1 to 15 . b. Suppose the goal state is 11 . List the order in which nodes will be visited for breadthfirst search, depth-limited search with limit 3 , and iterative deepening search