for F $=\{$A$->$C$,$ A$->$B$,$ C$->$D$\}$

what's the highest NF $($no NF$,1$NF$,2$NF$,3$NF$,$ BCNF$)$ that R is in$?$ explain

next, decompose so that the decomposition satisfies the next higher normal form than the one R itself satisfies

then show the canonical and minimal covers of functional dependencies for the decomposed relation schemas and list their candidate keys

prove a lossless decomposition$-$join decomposition and$/$or dependency

preserving