1. The universal relation schema Q (CTHRSG), where C= course, T= teacher, H= hour, R= room, S= student, and G= grade. 2. The minimal set of functional dependencies F are assumed: CT each course has one teacher HRC only one course can meet in a room at one time. HTR a teacher can be in only one room at one time. CSG each student has one grade in each course. HSR a student can be in only one room at one time. 3. The decomposition of the universal schema Q(CTHRSG) based on the algorithm (Lossless Join and Dependency-Preserving Decomposition into 3NF Relation Schema) is D={R1,R2,R3,R4,R5},whereR1={CT}R2={HRC}R3={HTR}R4={CSG}R5={HSR} 4. HS is the key of R, and is a part of R5. Please apply the Lossless Join Testing algorithm to see if the decomposition D is a lossless join decomposition. Please provide testing details step by step when you apply the set of functional dependency for testing (20 points)