[25 marks] Consider a relation schema N (R, F), where R- {A, B, C, D; and F A B. BC->A, BC->D} . Perform the following tasks. Justify your answers. C, D 1) 2) 3) Identify all keys for N. Show process. Identify the highest normal form (INF, 2NF, 3NF, BCNF) that N satisfies. If N is not in BCNF, compute a lossless decomposition into a set of BCNF relation schemas that preserve attributes and functional dependencies Verify explicitly whether your result has the lossless property, satisfies BCNF, and that all attributes and functional dependencies are preserved. 4)