Consider the following relations containing airline flight information:

Give the relational algebra statement "When possible". if there is not an algebra method to do something then state it cannot be done.

Flights(fino: integer, from: string, to: string, d'istance: integer, departs: time, arrives: time) Aircraft( aid: integer, aname: string, cTuisingrange: integer) Certified( eid: integer, aid: integer) Employees(eid: integer, ename: string, salary: integer) Note that the Employees relation describes pilots and other kinds of employees as well; every pilot is certified for some aircraft otherwise, he or she would not qualify as a pilot), and only pilots are certified to fly. Write the following queries in relational algebra, tuple relational calculus, and domain relational calculus. Note that some of these queries may not be expressible in relational algebra. For such queries, linformally explain why they cannot be expressed. 1) Find the names of pilots certified for some Boeing aircraft. 2) Identify the flights that can be piloted by every pilot whose salary is more than $100,000. 3) Find the eids of employees who make the highest salary. 4) Find the eids of employees who are certified for the largest number of aircraft. 5) Find the total amount paid to employees as salaries