Database management systems is the class I am in. I need help solving these usuing normal form algorithms.

Consider the universal relation R - iA, B, C, D, E. F. G. H, 1, and the set of functional dependencies F-{ (A. B-Iq,ID, IB-E. (F)(G, H}, {D}1.What is the key for R? is the vel 2. Repeat Anesthien1. for the following different set of functipnal dependen- 3 Consider the following relation: TUPLE# #1 #2 #3 10 bl el cl b4 b3 bl b3 12 13 #5 #6 c4 Given the previous extension (state), which of the following dependen- cies may hold in the above relation? If the dependency cannot hold, explain why by specifying the tuples that cause the violation. a. b. Does the above relation have a potential candidate key? If it does, what is it? If it does not, why not? Consider a relation R(A, B, C, D, E) with the following dependencies: ls AB a candidate key ofths relation? Ifnot, is ABD? Explain your answer. 5 . Consider the relation R, which has attributes that hold schedules of courses and sections at a university: R (Course no, Sea_no, Offering dept, Credit_hours, Course Jevel, Instructor ssn, Semester, Year, Days hours, Room no,3 No of students). Suppose that the following functional dependencies hold on R: (course_no} { Offering, dept. Cred,hours, course-level} [Course-no, Seeno, Semester, Year) { Days-hours, Room-no, Roonno, Days-hours, Semester, Year-+/Instructor-ssn, Course-no, Sec_no Betermine which sets of attributes form keys of R