Consider a relation R (ABCDEFGH) with the following functional dependencies:

ACD --> EF

AG --> A

B --> CFH

D --> C

DF --> G

F --> C

F --> D

Find minimal cover and identify all possible candidate keys. In order to receive full credit, please list each step taken and the rules that you applied.