Consider a state space where the start number is 2 and the successor function for state n returns two states, number 3n -2 and 3n-1. (a)  Draw the portion of the state space for states 2 to 41. (b) Suppose the goal state is 37. List the order in which nodes will be visited for breadth first search, depth first search. (c)  Suppose the goal state is 13. List the order in which nodes will be visited for depth first search with limit 2 and iterative depending search.

Consider a state space where the start number is 2 and the successor function for state n returns two states, number 3n -2 and 3n-1.

(a)  Draw the portion of the state space for states 2 to 41.

(b) Suppose the goal state is 37. List the order in which nodes will be visited for breadth first search, depth first search.

(c)  Suppose the goal state is 13. List the order in which nodes will be visited for depth first search with limit 2 and iterative depending search.