1. Consider the relation R[A, B, C, D, E, F, G, H, I, J) and functional dependencies {F} ? {G,H) What is the key for R? Decompose R into 2NF and then 3NF relations 2. Consider a relation RA, B, C, D, E) with the following dependencies. A, B (C) (D, E} ? {B) Is AB a candidate key of R? What about ABD? Explain your answer. 3. Consider the relation R, which has attributes that hold schedules of courses and sections at a university; RCourse_no, Sec_no, Offering_dept, Credit_hours Course level, Instructor ssn, Semester, Year, Days hours Room no, No of students). Suppose that the following functional dependencies hold on R: Course_no)(Offering_dept, Credit_hours, Course level) course no, sec no, Semester, Year) ? {Days hours, Room no, No of students, Instructor ssn) Room no, Days hours, Semester, Year Instructor ssn, Course no, Sec no Try to determine which sets of attributes form keys of R. How would you normalize this relation