Prolog programming basic

Task #1: (20 points) Create a knowledge base of your choosing. This knowledge base must include at least 10 items (including at least 7 facts and 3 rules) and you must come up with at least 5 querries (whereas at least two querries will involve facts, at least two querries will involve rules, and at least one query will have answer NO from prolog). Run the querries and show the answers (in README) you get from Prolog. Writing README carries 2 points. 2. Task #2: (20 points) Write a rule that will find the largest element of a list of integers. Run at least 2 querries and show the answers (in README) you get from Prolog. Your rule should work even if there are duplicate elements, postive integers, zero, and negatives integers. Writing README carries 2 points. 3. Task #3:) (20 points) Consider the following knowledge base: Interpretation of nonStopFlight(x,y) is that there is a one-way direct flight connection between airport x and y. nonStopFlight(la, chicago). nonStopFlight(philadelphia, la). nonStopFlight(columbus, philadelphia). nonStopFlight(sanFrancisco, columbus). nonStopFlight(detroit, sanFrancisco). nonStopFlight(toledo, detroit). nonStopFlight(houston, sanFrancisco). Write a recursive rule findFlight/2 that tells us whether there is a flight route from one town A to another town B. Run at least 3 querries (one with at least 2-hop route, one with one-hop route, one with no route) and show the answers (in README) you get from Prolog. Writing README carries 2 point.