Question: ai computer science question a search problem where the start...
AI (computer science question)
A search problem where the start state is number 1 and the successor function for state n returns 2 states, numbered 2n and 2n+1. For example, the successors of state 1 are 2*1 = 2 and 2*1+1 = 3, the successors of state 2 are 2*2 = 4 and 2*2+1 = 5, and so forth. In answering the questions that follow, assume the search space has an infinite number of states (violates our prior assumption of finite search problems, but only a mild violation as it is still discrete since the set of states is countably infinite).
a. Draw a graph of the portion of the search space for states 1 through 15.