Suppose you are given a relation R with four attributes $($WXYZ$).$ For each of the following

sets of FDs$,$ assuming those are the only dependencies that hold for R$,$ do the following: $(1)$

Identify the candidate key$($s$)$ for R$.(2)$ Identify the best normal form that R satisfies $(1$NF$,2$NF$,$

$3$NF$,$ or BCNF$).(3)$ If R is not in BCNF$,$ decompose it into a set of BCNF relations that preserve

the dependencies.