There are two minimal covers for

AB ®
C
C ® A BC ® D CD ® B D ® E D ® G BE ® C CG ® D CE ® G |
AB ®
C
C ® A BC ® D D ® E D ® G BE ® C CG ® B CE ® G |

a) |
b) |

**B:**

The definition of functional dependencies is a -> b holds on R if in
any legal relation r(R), for all pairs of tuples t_{1}and t_{2}
in r such that t_{1}[a] = t_{2}[a], it is also the case
t_{1}[b] = t_{2}[b].

Reflexivity rule: if *a* is a set of attributes, and *b* is
a subset or equal to *a*, then *a* -> *b*.

Assume there exists tAugmentation rule: if_{1}and t_{2}such that t_{1}[a] = t_{2}[a],

t_{1}[b] = t_{2}[b], sincebis a subset or equal toaa->b,definition of FD

Assume there exists tTransitive rule:_{1}and t_{2}such that t_{1}[ac] = t_{2}[ac]

t_{1}[c] = t_{2}[c] sincecis a subset or equal toac

t_{1}[a] = t_{2}[a] sinceais a subset or equal toac

t_{1}[b] = t_{2}[b] definition ofa -> b

t_{1}[bc] = t_{2}[bc] definition ofbc=bUNIONcac->bcdefinition of FD

Assume there exists t_{1}and t_{2}such that t_{1}[a] = t_{2}[a]

t_{1}[b] = t_{2}[b] definition ofa -> b

t_{1}[c] = t_{2}[c] definition ofb -> ca->cdefinition of FD

**C:**

See the SQL statements here.

*Best regards,*
*Kristian Torp*