1. Consider the relation R, which has attributes that hold schedules of courses and sections at a university. R = {CourseNo, SecNo, OfferingDept, CreditHours, CourseLevel, InstructorSSN, Semester, Year, Days_Hours, RoomNo, NoOfStudents}. Suppose that the following functional dependencies hold on R:
   1. {CourseNo} -> {OfferingDept, CreditHours, CourseLevel}
   2. {CourseNo, SecNo, Semester, Year} -> {Days_Hours, RoomNo, NoOfStudents, InstructorSSN}
   3. {RoomNo, Days_Hours, 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.