Can you solve this with steps

Let R(A,B,C,D,E,F,G,H) be relation schema and FD={FA,ACE,EB,BGF,BED, BDHE,DH,CDA,AE,ADBE} be a set of functional dependencies that hold on R 2.1 [5 marks] Provide a candidate key for R. (Make sure that the set of attributes you provide is minimal, in the sense that if an attribute is removed from the set, the set is no longer a candidate key.) 2.2 [15 points] Produce a BCNF decomposition of this schema using the algorithms presented in class. Make sure to clearly state what relations form the final decomposition of R. For each relation in the decomposition of R, provide its corresponding set of functional dependencies. Include the full details of your work. 2.3. [7 points] Use the "chase" algorithm presented in class to check whether your decomposition is lossless