let F, be a canonical cover for F; i:= 0; for each functional dependency a → B in F. i:= i+ 1; R, := a ß; if none of the schemas R,.j = 1, 2, ...,i contains a candidate key for R then i:= i+ 1; R, :=...

follow the algorithm in Figure 7.12. You do not need to be overly verbose, but each stage of the decomposition should be shown and justified. Be sure to clearly show the final decomposition

Extracted text: let F, be a canonical cover for F; i:= 0; for each functional dependency a → B in F. i:= i+ 1; R, := a ß; if none of the schemas R,.j = 1, 2, ...,i contains a candidate key for R then i:= i+ 1; R, := any candidate key for R; 1* Optionally, remove redundant relations */ repeat if any schema R, is contained in another schema R. then /* Delete R, */ R, := R;; i:=i- 1; until no more R,s can be deleted return (R1, R2. .., R,) Figure 7.12 Dependency-preserving, lossless decomposition into 3NF.