Normalizing a Dataset [6 points]For this question, use the auctions dataset available in the folder with this assignment. Infer and list the Functional Dependencies from the dataset. Your functional dependencies must be "future proof" i.e., if rows are added to the dataset, the functional dependencies you identify must still hold. E.g., if every first name and last name is unique, it may be tempting to say last name is a FD of first name (or vice-versa), but that realistically doesn't make sense! Here's a quick summary of how auctions work: An auction offers items for sale, called lots. Bidders bid an amount they are willing to pay for the presented lot. Bidders compete by offering higher and higher amounts, until nobody is willing to pay any higher for the given lot. Show the steps of normalizing the dataset, listing changes to get to 1NF, 2NF, 3NF and BCNF. If there are no changes, state why there are no changes. Only do the minimal number of changes at every step (i.e., do not do the steps needed for 3NF while showing the steps for 2NF).