1.In relation schema R=(ABCDE), we have F = {A -> B, BD -> C}. Make an instance (i.e., a table) r with 5 tuples, where at least two tuples should have the same value on A, and two other tuples have the same value on B, and have same value on D. This table must satisfy the requirement of F.

2.(Armstrong Axioms) Suppose we have the following relation schema R and set of functional dependencies F:

R = (A, B, C, D, E, F, G) F = { A -> BC CD -> AB EF -> AD B -> AEF}

For each of the following, determine whether it is in F+ (i.e., can be derived from F). If the answer is yes, show how it can be derived step by step (and indicate which rule in Armstrong axioms is involved). If not, explain why.

(a) AD -> EF

(b)B -> CD

(c)DE -> AC

(d)CEF -> G