Final answer:
To determine candidate keys, analyze functional dependencies. Strongest normal form is BCNF. Decompose relation into BCNF.
Step-by-step explanation:
In order to determine the candidate keys of a relation, we need to identify the minimal set of attributes that can uniquely identify each tuple in the relation.
We can do this by analyzing the functional dependencies in the relational schema.
The strongest normal form (also known as the highest normal form) of a relation is the one that eliminates all possible redundancies and anomalies.
In this case, we need to determine whether or not the relation is in Boyce-Codd Normal Form (BCNF).
To decompose a relation into relations in BCNF, we need to identify the functional dependencies and determine if any violations of the BCNF exist.
If there are violations, we can decompose the relation by applying the BCNF algorithm.