For a relation R(A, B, C) with three attributes A, B and C and a functional…

Given R(A, B, C) with functional dependency B -> C. Since A is not obtained from any dependency, a candidate key must include A. Also, B determines C, so (AB)+ = {A, B, C}; hence AB can be a candidate key. Now C is a non-prime attribute and it depends on B, which is a proper subset of the candidate key AB. This is a partial dependency, so the relation is not guaranteed to be in 2NF. Therefore 3NF and BCNF also cannot be guaranteed. Under the usual assumption that a relation schema has atomic attributes, the relation can only be said to be in 1NF. Hence option D is correct.