Finding minimal cover in functional dependencies

Finding minimal cover in functional dependencies

I just took a quiz in my introduction to databases courses which went over
minimal cover. I couldn't get this question right, and I still don't
understand the instructor's lecture on how he got to the answer. I am
having trouble understanding what to do after the first step of breaking
down the dependencies. What I have done so far is based off a previous
post, which is to break it first into individual dependencies. Any help
understanding how to find minimal cover would be greatly appreciated.
This is the problem I haven't been able to figure out-
Consider a relation R(A,B,C,D,E,F,G,H) with the following functional
dependencies:
AB->CD
H->B
G->DA
C->BG
CD->EF
A->HJ
J->G

What I have done so far is this, to try to simplify it:
H -> B
G -> D
G -> A
C -> B
C -> G
CD -> E
D -> F
A -> H
A -> J
J -> G