Prolog.

4) Route Given the following graph of possible flights between seven US cities: Omaha Seattle Albany Boston Fresno Dallas tlanta (graph taken from the web site of the American Mathematical Society, http://www.ams.org) Define a predicate route/3 that takes two cities as arguments and finds the routes to get from city A to a city B. Your predicate should have the signature route (cityA. ityB Route) Examples. 2- route(seattle, boston, X) X = [seattle, maha, atlant, bestonli false 2- route(fresno, atlanta, X) X- [fresno, seattle, omaha, atlantal; X- [fresno, albany, seattle, omaha, atlantal: X = [fresno, albany, dallas, seattle, maha, atlanta i false 2-route(albany, atlanta, x) X- [albany, seattle, omaha, atlantal; X- [albany, dallas, seattle. omaha, atlantal: false 2- route(bostou, atlanta, X) false