Consider a relational schema R(A, B, C, D, E, G, H) and a set of functional dependency F = {AB --> H, BD --> C, G --> E, D --> BE, D --> A, E --> AB}. Find out a minimal cover of the set of functional dependency and based on the minimal cover perform a 3NF dependency preserving decomposition of the schema R. do not answer if u r unsure.