Shortest way to find minimal cover

Question

1. Split the fd's such that rhs contains single attribute. 
2. Find the redundant fd's and remove redundant ones. 
3. Find the redundant attributes on lhs and remove them.like AB->C ,A can be deleted if closure of B contains A

Comments

Explanation with proper example would have been noble

---

2 point you use is false in the example