Consider the following collection of relations and dependencies.
assume that each relation is obtained through decomposition from a relation with attributes abcdefghi and that all the known dependencies over relation abcdefghi are listed for each question. (the questions are independent of each other, obviously, since the given dependencies over abcdefghi are different.)

for each (sub)relation: (a) state the strongest normal form that the relation is in. (b) if it is not in bcnf, decompose it into a collection of bcnf relations.

1. r1(a, c,b, d,e), a b, c-d

2. r2(a, b,f), ac-e, b-f

3. r3(a, d), d g, g h

4. r4(d, c,h, g), a , a

5. r5(a, i,c, e)

Match the personality traits with their description

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;

22. sata3 allows for data transfer rates of 600 mb/s. explain why you would likely not be able to copy data from one hard drive to another at anywhere close to this speed. also, what could be upgraded on the computer to achieve transfer speeds closer to 600 mb/s