/* compute the closure of an FD in this FD set (FDs)
                 * return the new FD as a new object
                 *
                 * TODO: implement
                 */
                public FunctionalDependency closureOfFD(FunctionalDependency F) {
                        FunctionalDependency fd = new FunctionalDependency();
                        // make sure this FD actually exists in our set
                        // if F exists in FDs
                        // newF = new FunctionalDependency();
                        //
                        // while (!F.equals(newF))
                        //   iterate over all FDs
                        //   for (FunctionalDependency Y: FDs)
                        //      if Y != F // don't use the same fd
                        //         if F.LHS.supersetOf(Y.LHS)
                        //             newF = F.RHS.add(Y.RHS) // add has to ret
urn a new FD object...
                        return newF;
                }