on the right $($marked as N$).$ If you are in a white spot, you can move by either $1$ step or $2$ steps to the right in one jump. For example, if you are in $1,$ then by jumping once, you can jump to either $2$ or $3.$ On the other hand, if you are in a black spot, you can move by $1,2,3,$ or $4$ steps to the right in one jump. You would like to reach your goal with the minimum number of jumps$\mathrm{.}1.(1$ points$)$ Explain how you would formulate the problem as a search problem. Clearly define what is a state in your formulation, initial state, successor function, and the goal test$\mathrm{.}2.(1$ points$)$ What is the size of your search space? What is the branching factor b$?3.(1$ point$)$ Propose a non$-$trivial admissible heuristic function to the problem.