Consider the following table schema: FlightCrew( flgtNo, aircrftNo, pilotNo, flgtAtdtNo) with the following FDs

1. flgtNo, pilotNo, flgtAtdtNo -> aircrftNo

This table is BCNF as the only FD defines a candidate key. Each flight must have two pilots and three to five flight attendents. In order to insure that searches on flight crew work correctly, each flight in the table must have a tuple for every pilot/flight attendant combination. Show the multi-valued dependencies this causes and decompose the table into two 4NF tables.