2. University Consider the relation R, which involves schedules of courses and sections at a university (shorthand notation written in parenthesis): R = {Course Number (C), Section Number (SN), Offering Department

(D), Course Type (CT), Credit Hours (CH), Instructor ID (I), Semester (S), Year (Y), Day and Hours (DH), Room Number (R), Number of Students Enrolled (NS)}. Assume that the following set of functional dependencies F holds on R: F = {{C} {D, CT}, {C, SN, S, Y} → {R, DH, NS}, {R, DH, S, Y} → {C, SN}, {I} → {D}, {CT} → {CH}, {D, CT} → {1}} a. Find the 2 candidate keys of R based on F. Please give the steps and argument to find the candidate keys.