Uninformed and informed search

1. In the given search space with the initial state represented by the integer number 1, every state (represented by the integer number) k has exactly 3 successor states: (represented by the integer numbers) 3k, 3k+1 and 3k+2. o(a) Draw the portion of the search space for states 1 to 16! . (b) Assume 12 is the goal state. Give the sequence of states in succession from initial to goal state for the following algorithms: breadth-first search, depth-limited search with depth limit of 3, iterative deepening! (C) Let's call the action of going from state k into state 3k Left, action of going from state k into state 3k+1 Ahead, and action of going from state k into state 3k+2 Right. Can you find an algorithm that solves any given problem (for any goal state) in our search space without actual search? Describe