Schema Design by Decomposition Problem-1: For each of the following collection of relations and functional dependencies, determine if relation(s) is/are in BCNF. If not, then decompose it into a set of BCNF relations. [5] 1a-R1A,C,B,D,E) A B, C =D 1b-R21A,B,F) AB FB F 1c-R3(A,B), R4C,D,E,F) A B, C D, D EF 1d- R5(A,B,C,D,E. D B, CE A 1e-R6(A,B,C,D,E) A E, BC A, DE B Problem-2: Given below is the set of functional dependencies for the relational schema: R = (A, B, C, D, E, F, G) [2.5] A, BC B, C D A, E F,G 2a- Find ALL minimal keys for the relation R. 25-Decompose the relation into a set of relations that are in BCNF. Problem-3: Given below is the set F of functional dependencies for the relational schema: R= (A, B, C, D, E, F) [2.5] AB B CD DF,A 3a- Find ALL minimal keys for the relation R. 3b-Now decompose these relations into a set of relations that are in BCNF