It is urgent !. Please I need its answer as fast as you can .

1. Consider the following set F of functional dependencies on the relation schema r ( A , B , C , D , E , F ) : ABCD . BC DE B - D D - A 1 )

Compute the closure of attribute B : B.

2 ) Prove ( using Armstrong's axioms ) that AF is a superkey.

. 3 ) Give a BCNF decomposition of r using the original set of functional dependencies.

2. ( 8 points ) ER Diagram and Relation Schema Consider a band database : Band : BandName , SetupDate Member Singer : msName , msGender Fans : fName , fGender Suppose a band are consist of many singers , and when a singer works for a band , the system should record the start date and end date , each band has a group leader , the leader is also a member of the band ; each fan can has own favorite music and band . Construct an E - R diagram for the band database .

IV. Database Design(16 points) 1. (8 points)Consider the following set F of functional dependencies on the relation schema r(A, B, C, D, E, F): ABCDBCDE Page 5/Total 6 pages BDDA 1) Compute the closure of attribute B:B+(2 points ). 2) Prove (using Armstrong's axioms) that AF is a superkey(3points). 3) Give a BCNF decomposition of r using the original set of functional dependencies( 3 points). 2. (8 points)ER Diagram and Relation Schema Consider a band database: Band: BandName, SetupDate MemberSinger: msName, msGender Fans:fName, fGender Suppose a band are consist of many singers, and when a singer works for a band, the system should record the start date and end date, each band has a group leader, the leader is also a member of the band; each fan can has own favorite music and band. Construct an E-R diagram for the band database