3. Consider the following universal relation schema for a BAND database BAND( Band ID, CD Nbr, Concert Fee, CD Tile, LabeL Name, Promoter, Promoter-contact, BandName, Royalty ) and the set of functional dependencies defined for this database F BandID, CDNbrRoyalty, [BandID BandName, (CD-Nbr) ? {cnTile, LabeLName}, { Promoter) ? { Promoter-contact)). To shorten the notation we represent BAND by R with the set of functional dependencies F. a. Suppose we have the following decomposition D of R: D-(ABI.BDEH,EG Does D have the attribute preservation property and the dependency preservation property? Justify your answers; yes or no by itself is worth 0 points Attribute preservation property: Dependency preservation property: b. Using the appropriate algorithm, find the key Kof R. Clearly show all your work for all steps of the algorithm (final answer by itself without shown work is worth 0 points)