Consider a relation with the following schema R(A, B, C, D,…
Consider a relation with the following schema R(A, B, C, D, E, F). We know there are two non-trivial FDs that are satisfied, which are AB->C, BD->F. Decompose R to make sure the database schema is in BCNF. Note: You only need to show the final database schema, but if you want to get partial credit in case you get something wrong, you should show intermediate steps as well.