Question 3. Given the following relation, functional dependencies and decomposition, answer the following questions: Relation R(A, B, C, D, E, F) with F-AB- F, BD C,CE F,F+D Decomposition: R1(A, B, D), R2(A, B,C, E), R3(B, D,E,F) (a) Is this decomposition lossless? Show yes or no using Chase algorithm. (b) Is this decomposition dependency preserving? Show your work. Note: two show that two sets of functional dependencies, F and F2 are equivalent, it is sufficient to show that (1) all functional dependencies in F1 are implied by F2, and (2) all all functional dependencies in F2 are implied by F1