1. How to decompose (A, B)-> E, (C, D)-> E, A-> C, C-> An into BCNF,?

2, U = (Agraine Brecinct C pyrrhene E) F = {B-> Greco ce-> Breco C-> Areco B-> Dle le C-> D}. Decompose into BCNF?

3. The BCNF decomposition that I understand at present is to find out the code first, then find out the dependency that does not satisfy BCNF, and then split it one by one, until all the patterns satisfy the BCNF relation at last, but there is a lot of confusion in these two decompositions. For example, in question 2, the code is CE, which first decomposes B-> G to get (BG), and then decomposes C-> A to get (CA), and then decomposes B-> D to get (BD),. At this time, there is also F = {CE- > BMagee C-> D}, while there can"t be any change of D br C-> D in F at this time. I don"t quite understand this. I queried a lot of materials and did not find the correct answer.

4. I urge all the great gods to show the steps of decomposition in detail in order to better understand (I am self-taught, I may not have a firm grasp of some knowledge, please forgive me), thank you!