Let r=(a,b,c,d) be a relation schema, and let f={c→d,c→a,b→c} be a set of functional dependencies (FDs). Is r in Boyce-Codd Normal Form (BCNF) with respect to f? If it is, explain why; otherwise, decompose r into a set of schemas in BCNF.