now please provide me the answer for the question consider a relation R$=\{$A$,$B$,$C$,$D$,$E$,$F$,$G$,$H$,$I,J$\}$ Whose primary key is $\{$A$,$D$,$J$\}$ and the following set of functional dependencies S is specified on it: S$=\{$EI$->$FG$,$A$->$BHI,AH$->$CEF,ABD$->$G$\}(1)$ Find the minimal cover of S shown each step you followed $(2)$ Decompose R into $3$NF BY Using its primary key and the minimal cover you found $(3)$Check if your $3$NF decompostion has the non$-$additive join$($ also known as lossless join$)$ property by applying the non$-$additive join decomposition test algorithm given in our textbook clearly show each step you followed

please help as i only get R$1,$R$2,$R$3$