A. Does the referential integrity constraints exist? if yes, explain it.

B.

2. What are the superkeys and candidate key 3. What is the primary key of flight relationships 4. What is the relationships normal form of the flight relationships, explain why is not....

THIRD STATUS 30 20 S# S1 S2 S3 S4 S5 CITY MONTREAL OTTAWA VICTORIA QUEBEC VANCOUVER 30 60 SP P1 S# S1 S1 S1 S1 PS P3 P4 P6 QTY 600 500 100 700 500 100 300 700 500 500 700 400 S2 S3 54 S4 S4 Pi P2 P2 P2 P4 PS Base on the relations of THIRD and SP, can we say that referential integrity constraint exists? If one does, explain what it is Exercise 1. FLIGHT (Flight#, Origin, Destination, Mileage) Mileage 1768 FLIGHT Flight# AL706 AL456 AL897 AL256 AL8710 AL 912 AL488 AL7325 ALT318 Origin Ottawa New York Boston Toronto Minneapolis Qubec Toronto Vancouver Qubec Destination Toronto Victoria Montreal Los Angeles Montreal Victoria London Montral Vancouver 1300 880 1058 1100 400 a. What is (are) the sureckex(s) candidate key(s) for the FLIGHT relation? Please show your answer using the following table. Superkey Candidate Key I Flight# origin Destination Mileage (Flight+, Origin) (Flight#, Destination) (Flight#, Mileage) (Origin, Destination) (Origin, Mileage) (Destination, Mileage) (Flighti, Origin, Destination) (Flight. Origin, Mileage) (Flight#, Destination, Mileage) (Origin, Destination, Mileage) (Flight. Origin, Destination, Mileage) b. What is the primary key of the FLIGHT relation? C. What is the relational normal form of the FLIGHT relation? Please explain why it is not in the next highest normal form unless it is already in Boyce-Codd Normal Form