QUESTION Normalize the following relations when each one satisfies the specified functional dependencies. Decompose into the highest possible normal form. Show your work ONE STEP at a time. In particular, show the list of all candidate keys of the original relation. In your decomposition show the attributes in each relation as well as the keys and embedded FDs. A- The relation is ABCDE ACD- B B- The relation is ABCDEF BC-D CDFB C- Consider this table. ABCDEFG 3 small black new 4 Lee inch 6 small gold old 4 Lee foot 3 big black new 4 Lee inch 3 big black old 4 Lee inch 6 big gold old 5 Lee foot Given this data, determine which of the following statements are apparently true or false. 1-FA 3- [A, B]-F 4-C-G 5- [A, B, DI-> [C, E, F, GI