I'm having trouble with this question in my Intelligent Systems class. It has to deal with state space and search trees and I'm not sure how to draw it.

How do I do this?

3. Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k and 2k1. (a) Draw the portion of the state space for states up to the 4 th level in the search tree (1st level is the start state 1 ) [6 points] (b) Suppose the goal state is 7. List the order in which nodes will be visited for breadth-first search, depth-limited search with limit 3 , and iterative deepening search. [15 points ] (c) How well would bidirectional search work on this problem? What is the branching factor in each direction of the bidirectional search? [6 points]