Boyce$-$Codd normal form

We have the attributes: $\{A,B,C,D,E,F,G\}.$

Consider the following functional dependencies

The first step in computing the normal form, is to derive a canonical $($minimal$)$ set of

functional dependencies. We have already done this first step for you. The following is a set

of canonical functional dependencies $($for the dependencies shown above$)$:

We have also computed the minimal keys for you:

Apply the synthesis algorithm to derive a Boyce$-$Codd normal form for the relation

$R(A,B,C,D,E,F,G).$