You are tasked with developing a delivery route optimization system for a city's package delivery service. The city is represented as a grid of intersections connected by roads. The primary goal is to assist delivery vehicles in finding the most efficient route from a central warehouse to multiple delivery points, optimizing for the shortest total distance while minimizing traffic congestion.

$**$Requirements for question $1$: $**$Define the City Grid and Delivery Points: Create a representation of the city as a grid with intersections and roads. Define multiple delivery points where packages need to be delivered.

$**$Implement Search Strategies: $**$Implement two search strategies to find the optimal delivery route covering all delivery points. You may use one with an A$*$ search strategy and another without using heuristics. Compare the total distance traveled and the number of intersections visited.

$**$Performance Comparison: $**$Evaluate the efficiency of each search strategy in terms of Total distance traveled & Number of intersections visited.

Visualization: Visualize the delivery route and the explored intersections for each strategy.