Bernstein's Algorithm for Functional Dependencies

i need a program that will solve Bernstein's Algorithm for Functional Dependencies. Here is what it looks like: Note: 3NF = 3rd normal form. FD's = functional dependencies. a) Make all right hand side of FD's a single attribute. b) Check for extraneous attributes for all FD's. c) Check and remove all redundant FD's. d) Sub-group FD's with the same left hand side. e) Write relations such that each sub-group gives a single relation. f) Using following input as example file. ABC->CD CE->GA GE->BD D->GE ## Deliverables My professor said the program could be written in C++ using structured arrays and functions. The data (AB->C) should be read in from a data file. Also, afetr each step, the program should print the results. ## Deadline information Must be completed by 12/2