Use the synthesis algorithm to find a minimal cover of the following relation and find the resulting 3NF decomposition. Show a lossless join test of the resulting decomposition. R(A...H) with the following FDs: A->BC H->AF BG->E C->F B->D AH->G DG->E