Given the following dependencies F = {AB->CDEF, AF->ED, F->B} which ONE of the following is the highest normal form that a table R=ABCDEF could satisfy.

Select one:

a. No normal form would be satisfied.

b. Boyce-Codd Normal Form

c. 1st Normal Form

d. 2nd Normal Form

e. 3rd Normal Form