Write the following queries in datalog and SQL:1999 SYNTAX: 1. Find the fino of all flights that depart from Madison.
2. Find the flno of all flights that leave Chicago after Flight 101 arrives in Chicago and no later than 1 hour after.
3. Find the fino of all flights that do not depart from Madison.
4. Find all cities reachable from Madison through a series of one or more connecting flights.
5. Find all cities reachable from Madison through a chain of one or more connecting flights, with no more than 1 hour spent on any connection. (That is, every connecting flight must depart within an hour of the arrival of the previous flight in the chain.)
6. Find the shortest time to fly from Madison to Madras, using a chain of one or more connecting flights.
7. Find the flno of all flights that do not depart from Madison or a city that is reachable from Madison through a chain of flights.