The Development of the final Project will consist of the creation of our own Google Maps algorithm, for this we will use the following map as a base:

$1.$ Using the search algorithms that we have seen in class, develop a program that finds all possible routes to get from McDonald's to Pergamino Caf$.$

$2.$ This algorithm must store the total cost of each of the routes.

$3.$ After this, apply a sorting algorithm to the obtained routes and find the following results:

a Print a list of routes ordered from shortest to longest $($based on distance in Kms$).$

b Print a list of the routes in order from the one with the fewest turns to the one with the most turns.