pls give answer in 20 min pls ..

Given the following set of functional dependencies for relation schemas R1=(A,B,C,D,E, F) and R2 =(A,B,C,D,E,F,G) 1) F={ABC,BCAD,DE,CFB} in [R1] 5 1.a) Compute the closure of (AB)+,(BC)+,(D)+ 1.b) Find the possible set of candidate keys 2) F={ABC,BCDE,DF,CFG} in [R2] 5 2.a) Compute the closure of (BC)+,(CF)+,(D)+ 2.b) Find the possible set of candidate keys