(5 pts) Consider the relation R, which has attributes that hold schedules of courses and sections at a university. R [Cours No, OfferingDept, CreditHours, CourseLevel, InstructorSSN, Semester, Year, Days Hours RoomNo NoOfStudents). Suppose that the following functional dependencies hold on R: a. CourseNol- OfferingDept, CreditHours, CourseLevel b. CourseNo, SecNo, Semester, Year) -> [Days Hours, RoomNo, NoOfStudents, InstructorSSN c. oomNo, DavsHours, Semester, Year] ->InstructorSSN, CourseNo, SecNo) Try to determine which sets of attributes form keys of R. How would you normalize this relation to as high as 3NF? If there are multiple keys, choose one