Use prolog

1. Consider the following graph of possible flights between seven US cities. Omaha Seattle Albany Boston Fresno Dallas Atlanta Each edge from a vertex X to a vertex Y represents that there is a flight between city X to city Use the database that you created for the above graph in HWI to solve the following: 1. Write a prolog program that would check if there is a route from city X to city Y. (50 points) 2. Using your program, design queries to check whether there is a route from city X to city Y. (50 points) city X Dallas Dallas Omaha Atlanta Fresno city Y Atlanta Boston Fresno Seattle Dallas