I am having troubles when I trying to solve this question. Can someone help me?
Consider the relation schema R=(A, B, C, D) with an unknown set of functional dependencies: What is the maximum number of (candidate) keys that R may have? Design a set of functional dependencies on R to achieve the maximum number of (candidate) keys.