Given a relation schema R $=\{$ A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G $\}.$ Find the keys of R and then

decompose R into highest normal form for the following functional dependencies :

i$)$ F $=\{$ AB $->$ C $,$ F $->$ G $,$ A $->$ DE $\}$

ii$)$ F $=\{$ BD $->$ EF $,$ AD $->$ G $,$ AB $->$ C $\}$