Relational database design

Question 1:
Given a relation schema R(A, B, C, D, E, G, H),
with F={A→BC, B→C, C→DG, D→CG, H→DEG, E→DH}

1- Give a minimal cover of F

⇒ {A→B, A→C, B→C, C→D, C→G, D→C, D→G, H→D, H→E, H→G, E→D, E→H}
Result = {A→B, B→C, C→D, C→G, D→C, H→D, H→E, E→H}

2- Determine all keys of R

Essential attributes: A
A+ = ABCDG
AB+ = ABCDG
AC+ = ABCDG
AD+ = ABCDG
AE+ = ABCDG
AG+ = ABCDG
AH+ = ABCDG
* We stop because we already know that ABCDG+ = A+
Candidate keys: {AE, AH}

Question 2:
Given a relation schema R(A, B, C, D, E, F) with F={A→BC, B→C, C→BD, BD→E, E→D}
1- Give two different minimal covers of F
⇒ {A→B, A→C, B→C, C→B, C→D, BD→E, E→D}
Result = {A→B, B→C, C→B, C→D, A→E, E→D} &
{A→B, B→C, C→B, C→D, C→E, E→D}

2- Determine all keys of R

Essential attributes: AF
AF+ = ABCDEF
Candidate keys: {AF}

3- Determine C+and (CE)+

Essential attributes: C+
C+ = BCDE
{CE}+ = BCDE
Question 3:
Given the following relation schemas and the sets of FD’s:
a- R(A,B,C,D) F={AB→C,C→D, D→A, BC→C}
Essential attributes: B
B+ = B
AB+ = ABCD
BC+ = ABCD
BD+ = ABCD
Candidate keys: {AB, BC, BD}
b- R(A,B,C,D) F={B→C, B→D, AD→B}
Essential attributes: A
A+ = A
AB+ = ABCD
AC+ = AC
AD+ = ABCD
Candidate keys: {AB, AD}
c- R(A,B,C,D) F={AB→C, DC→D, CD→A, AD→B}
Essential attributes: 𝜙
A+ = A
B+ = B
C+ = C
D+ = D
AB+ = ABC
AC+ = AC
AD+ = ABCD
BC+ = BC
BD+ = BD
CD+ = ABCD
Candidate keys: {AD, CD}
d- R(A,B,C,D, E) F={AB→C, C→D, D→B, D→E}
Essential attributes: A
A+ = A
AB+ = ABCDE
AC+ = ABCDE
AD+ = ABCDE
AD+ = AE
Candidate keys: {AD, CD}
e- R(A, B, C, D, E) F = {AB→C, DB→E, AE→B, CD→A, EC→D}
Essential attributes: 𝜙
A+ = A
B+ = B
C+ = C
D+ = D
E+ = E
AB+ = ABC
AC+ = AC
AD+ = AD
AE+ = ABCDE
BC+ = BC
BD+ = BDE
BE+ = BE
CD+ = ACD
CE+ = ABCDE
DE+ = DE
ABC+ = ABC
ABD+ = ABCDE
BCD+ = ABCDE
BDE+ = BDE
Candidate keys: {AE, CE, ABD, BCD}
In each case,
(i) Give all candidate keys