If $(\{P, Q\} \rightarrow\{R\}$ and $\{P\} \rightarrow\{R\})$, then $\{Q\} \rightarrow\{R\}$

If $\{P, Q\} \rightarrow\{R\}$, then $(\{P\} \rightarrow\{R\}$ or $\{Q\} \rightarrow\{R\})$

If $(\{P\} \rightarrow\{R\}$ and $\{Q\} \rightarrow\{S\})$, then $\{P, Q\} \rightarrow\{R, S\}$

If $\{P\} \rightarrow\{R\}$, then $\{P, Q\} \rightarrow\{R\}$

It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

$R$ can have a multi-attribute key

$R$ cannot have a foreign key

$R$ cannot have a composite attribute

$R$ cannot have more than one candidate key