Consider the Flights relation: Flights(fino: integer, from: string, to: string, distance: integer, departs: time, arrives: time)
Write the following queries in Datalog and SQL:1999 syntax:
1. Find the fino of all flights that depart from Madison.
2. Find the .fino 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 NIadison.
4. Find aJI cities reachable frOlll l\iladison through a series of one or 1I10re connecting flights.
5. Find all cities reachable from IVladison through a chain of one or rnore connecting flights, with no 1I1Ore than 1 hour spent on any connection. (That is, every connecting flight must depart 6. Find the shortest tilne to fly frOl11 ~IIadison to i\dadras, using a chain of one or 1nore connecting flights.
7. Find the Jlno of all flights that do not depart [1'0111 ~!Iadison or a city that is reacha. ble frolIlrvladison through a chain of flights.