Task 5 Max: 14308: 15 Points, 5360: 12 Points Consider a search space, where each state can be a city, suburb, village, farm, or mountain. The goal is to reach any state that is a mountain. Here are some rules on the successors of different states: Successors of a city are always suburbs. Each city has at least one suburb as a successor Successors of a suburb can only be cities, or suburbs, or villages Each suburb has at least one suburb as a successor Successors of a village can only be villages, or farms, or mountains Each village has atleast one farm as a successor Successors of a farm can only be villages, or farms, or mountains Each form has at least one other farm as a successor, Successors of a mountain can only be mountains Define the best admissible heuristic h you can define using only the above information (you should not assume knowledge of any additional information about the state space). By "best admissible" we mean that h(n) is always the highest possible value we can give, while ensuring that heuristic h is still admissible. Assume that any move from one state to another has costi