Compute the minimal basis of each FD set, then compute the projection
over a decomposition that places each FD in its own relation. Identify
any oddities in the schema that results (e.g. redundant relations, not
in BCNF form but fixable, not possible to put in BCNF form and why)

====================

1. Starting FDs:
	A C H -> D
	A D -> E F
	B -> G
	E F -> A B D
	F -> B D H

====================

2. Starting FDs:
	B -> A E F G H
	B G -> D
	C -> A E
	G -> B D E

====================

3. Starting FDs:
	A -> D G
	B D -> C F
	C -> E G
	C D -> B E
	C F -> A B

====================

4. Starting FDs:
	B -> H
	B G -> E F H
	B H -> C
	C E -> B H
	C H -> D

====================

5. Starting FDs:
	C F H -> B
	D E -> C H
	D G -> C
	E -> D
	E G H -> D

====================

6. Starting FDs:
	A B C -> F
	B D G -> A C F
	C -> D F
	D F -> C
	E H -> A C D

====================

7. Starting FDs:
	A F -> G H
	B -> C D H
	B C E -> D
	B D -> C
	G -> D F

====================

8. Starting FDs:
	B -> A C H
	B E G -> F
	C D H -> B G
	D -> A
	D E F -> A

====================

9. Starting FDs:
	A B F -> C D H
	A B G -> F
	C H -> B F G
	G -> F H

====================

10. Starting FDs:
	A -> G
	D -> E H
	D H -> F G
	E -> B D

====================

11. Starting FDs:
	A C -> D E F
	B F H -> A D E
	C E F -> B H
	D H -> B
	G -> E

====================

12. Starting FDs:
	B C E -> A G
	C G -> E
	E -> B
	F G -> B

====================

13. Starting FDs:
	A F -> E H
	D F -> E
	E -> C D G
	E H -> A G
	H -> A F

====================

14. Starting FDs:
	A C G -> B D H
	C D G -> A F
	C E H -> D
	C G -> E
	E F G -> A C

====================

15. Starting FDs:
	F -> B E G H
	F H -> B C
	G -> E

====================

16. Starting FDs:
	A C H -> B E
	C F G -> E
	D -> G H
	E -> A
	G -> C

====================