In relational databases, there is a concept known as ________ which means that related tables must be consistent with one another

The Boolean values are on and off.

Answer the following statement true (T) or false (F)

Consider a schema S with functional dependencies:

{A->BC, C->FG, E->HG, G->A}. (a) Compute the attribute closure of A with respect to S. (b) Suppose we decompose S so that one of the subrelations, say called R, contains attributes AFE only. Find a projection of the functional dependencies in S on R (i.e., find the functional dependencies between attributes AFE). (c) Is R in BCNF? Explain. If not, use one cycle of the BCNF decomposition algorithm to obtain two sub relations, and answer whether they are in BCNF. (d) Show that your decomposition is lossless. (e) Is your decomposition dependency preserving? Explain. (f) Is R in 3NF? Explain. If not, use 3NF decomposition algorithm to obtain sub relations, and answer whether they are in 3NF.