database design – highest normal form

Consider the relation R(A,B,C,D,E,F) with F={A->F,D->AC,B->FA, FE->B} State the highest normal form R is in, if R is not in BCNF If the relation is not in BCNF, decompose the relation losslessly so that the resultant relations are all in BCNF and dependency preserving

so far i got that the canditate key is (D,B,E)+ the prime attributes are {D,B,E}, non prime are {A,C,F}, so i think it’s in first normal form