Consider the Following Relational Schemas and Functional Dependencies $\rightarrow$ B, C $\rightarrow$

Consider the following relational schemas and functional dependencies. Assume that the relations have been produced from a relation ABCDEFGHI and that all known dependencies for this relation are listed. State the strongest normal form for each one and, if appropriate, decompose to BCNF.
(a) R(A, B, C, D, E); A $\rightarrow$ B, C $\rightarrow$ D
(b) S(A, B, F); AC $\rightarrow$ E, B $\rightarrow$ F
(c) T(A, D); D $\rightarrow$ G, G $\rightarrow$ H
(d) U(C, D, H, G); A $\rightarrow$ I, I $\rightarrow$ A
(e) V(A,C, E, I)