What does this mean

Task $4(3$ marks$)$

Normalization of relational schemas

Find the highest normal form valid in the relational

schemas listed below and decompose the schemas into

BCNF schemas whenever it is necessary.

In all tasks listed below you must apply the following steps

to normalize the relational schemas.

$($i$)$ Apply the derivations of functional dependencies to find

the minimal keys. Provide information about the

derivation rules applied in each derivation of a minimal

key.

Please note that you MUST use derivation rules to find

the minimal keys. Any other teachniques like applying

"closure" or "educated$/$wild guess" or "speculation" or

dots are not allowed and such solutions will score no

marks for the entire task.

$($ii$)$ Apply the definitions of normal forms to find the highest

normal form valid for a schema.

$($iii$)$ If a relational schema is not in BCNF then

decompose it into the smallest number of relational

schemas, each one in BCNF$.$ Try to enforce as many

functional dependencies as it is possible in the

decomposed schemas.

$R(A,B,C,D)$

$F=\{AB,AC,CD,BC\}$

$(2)R(A,B,C,D)$

$F=\{D^{}C,C^{}A\}$

$(3)R(A,B,C,D)$

$F=\{ABC{B}^B,BA\}$

Deliverables

A file solution$4.$pdf with the solutions of the

problems $(1),(2),$ and $(3).$ Note that you MUST use

derivation rules to find the minimal keys. Any other

teachniques like applying "closure" or "educated$/$wild

guess" or "speculation" or $...$ are not allowed and any such

solution scores no marks for the entire task.