Problem Statement :

You are tasked with developing an intelligent agent for a delivery robot employed to delivergroceries in a bustling city. You are provided with a map of the city with important locationsmarked, including the households and the roads connecting them. The distance between each pairof households is given, representing the cost $($in terms of travel distance$)$ to deliver groceries fromone household to another. The Grocery Delivery Agent is tasked with finding the shortest routethat covers all the households in a given neighborhood, starting from any node. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The averageof the total distance cost across all these paths is the heuristic value h$($n$).$ Define the heuristic and or fitness function for the given algorithms $($Recursive Best First Search A$*$ and Hill climbing algorithm$)$ and the given

Graph representation

Use the following algorithms to solve the problem:

Recursive Best First Search A$^(**)$

Hill climbing algorithm