Minimal Cover and functional dependencies

Question

Given the following functional dependencies how would I compute the minimal cover:

A -> B, ABCD -> E, EF -> GH, ACDF -> EG

In the lectur

Answer 1

According to me,In the above functional minimal dependencies ACDF -> G should also be included because when you take closure of each letter on left side and their combination none of them produce G without including F

So it would be as follows:

(A -> B, EF -> G , EF -> H , ACD -> E , ACDF -> G )