Implement the Search(source, destination) procedure between cities.
Define a map consisting of at least 8 cities. Give each city name and define some connections (undirectional) between cities. Include a few cycles in the map.
for the internal representation assign an integer to each name.
Write a main function that asks for two cities, source and destination, by name. The names should be converted to integersa and the search funtion should be called. (show at least 3 different searches.)
After finding a path, print the names of the cities instead of the integers. This can be done while coming out of the recursion calls: or after the path is formed with integers, the main function can call a funtion that will transform the integers back to names.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.