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. a) Draw the portion of the state space for states 1 to 31. b)...

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.

a) Draw the portion of the state space for states 1 to 31.

b) Suppose the goal state is 12. List the order in which nodes will be visited for depth first search if we start with the left side of the tree, depth first search if we start with the right side of the tree, and breadth first search.

c) Calculate the total time in terms of number of nodes each algorithm will take to find the goal state 12.