Problem Statement : You are tasked with developing an intelligent agent for a delivery robot employed to deliver groceries in a bustling city. You are provided with a map of the city with important locations marked, including the households and the roads connecting them. The distance between each pair of households is given, representing the cost (in terms of travel distance) to deliver groceries from one household to another. The Grocery Delivery Agent is tasked with finding the shortest route that 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 average of the total distance cost across all these paths is the heuristic value h(n).