Show that it is possible to ensure that a dependency-preserving decomposition into 3NF is a loss less-join decomposition by guaranteeing that at least one schema contains a candidate key for the schema being decomposed.