Suppose we are starting at Hirsova and trying to navigate to Neamt. Assuming that we will move from one city to the next city in one moving step.

a$.$ Formulate the problem with state space, successor function, goal, and step cost function.

b$.$ How large is the state space, list some of the state space?

c$.$ Formulate the problem with the assumption that we know ahead of time that Urziceni is on the path and Bucharest is not on the path.