CSC4402 Homework 5 Due Tuesday Nov. 13, 2018 . Shown below is a relation instance for the relation R with relation schema RABCDE) Relation instance for (R) A B CD E A BCD E A B C D E A B C DE Consider the set of functional dependencies F-(AB, BCD, D E CD E For each functional dependency (fd) in F. determine whether or not this fd is satisfied by this relation instance for R. Briefly explain your answer for each fd (why the fd is satisfied (or not) by this relation instance). 2. Let R(ABC) be a relation with attributes A, B and C. Let Fi and F: be sets of functional dependen- cies where F,-{ A B,A+C)and F2-AB, B C) (Here to get some intuitions about the relation R, you may think of R as representing information a person attribute A represents the SSN of the person, attribute B represents the address of the person, and attribute C represents the phone number of the person. However, this visualization of R should NOT impact your answers to the question) (21) Compute FT-F1 (using the compact representation we discussed in class). Is F, cquivalent to F Explain your answer (2.2) Let F,-{A+ B. B-. -} . Are F, and F, equivalent? Explain your answer. Let R(ABCDE) be a relation schema and let F = {AB E, BE C. CE D, E B. BC D; be the set of functional dependencies that are satisfied by R. (3.1) Using the computation of attribute closure X, determine if each functional dependency below 3. is in F" or not. (3.2) Is Falready minimal? Explain your answer Let R(ABCDEG) be a relation schema and let the set of functional dependencies satisfied by R be (4.1) Compute a minimal cover of F. Show the steps in your computation. 4. (4.2) Compute an LLJ BCNF decomposition of R. Is it possible to get a BCNF decomposition for the relation R which is both LLJ and fd-preserving? Show your decomposition tree, and the fd's used in each decomposition step. Moreover, for each relation R, at a leaf node in the tree, show the set of functional dependencies F, that hold true on R 5. Let R(ABCDE) be a relation schema and let the set of functional dependencies satisfied by R be (5.1) Compute a minimal cover of F. Show the steps in your computation. (5.2) Compute an LLJ and fd-preserving 3NF decomposition of R. Show the intermediate steps in answering this