6. Consider the universal relation STUDENT StuID, SSNum, FName, LName, Major, Dept, Group) with the following set F of functional dependencies: StuID - SSNum, Major SSNum FName, LName. StulD StulD Dept Major -> Dept FNameGroup a. Identify all of the candidate keys of F. b. Construct a decomposition of EMPLOYEE into relations in 3NF that has both the dependency preservation property and the lossless join property. Use the algorithm discussed in class, and show your work. (Answers that show only the final result without showing the steps taken to obtain it will receive no credit.) (Hint: I will tell you that if you split StulD -> SSNum, Major into two functional dependencies, split SSNum -> FName, LName, SID into three functional dependencies, and remove StulD Dept, then the resulting set is a minimal basis of F.)