$)$ Define the term minimal cover set and outline an algorithm for finding

a minimal cover set of a set of functional dependencies.

Given R$($A$,$B$,$C$,$D$)$ and F $=\{$A$->$B$,$ C$->$ B$,$ D$->$ ABC, AC$->$D$\}$

Find a minimal cover set for the set F$.$