Consider the following functional dependencies, Find a minimal cover

Question

consider a relation schema with attributes ABCGWXYZ and the set of dependencies

F{XZ-ZYB, YA-CG, C-W, B-G, XZ-G}

solve the following problems using the appropriate algorithms

A: find the minimal cover for f

what i find is:

XZ-Y
XZ-B
XZ-G
YA-C
YA-G
C-W
B-G

pretty much everything in the f, but the solution says, XZ-G is redundant. Can anyone explain to me ?

B: is the dependency XZA-YB implied by f?

I just feel like the it ask is weird, i don't know how to answer ?

Answer 1

the solution says, XZ-G is redundant. Can anyone explain to me ?

XZ->B
 B->G