1 Construct a B +-tree for the following set of key values: 60,70,75,51,52,65,68,77,78,79 Assume that the tree is initially empty and values are added in ascending order. Construct B +- trees where order -4 2 2 Consider the following collection of relation schemes: EMAIL SID 101 102 103 104 STUDENTS FIRST LAST Ann Smith Michael Jones Richard Turner Maria Brown (null) SID 101 101 101 102 102 102 103 103 RESULTS CAT ENO H 1 2 M 1 H 1 H 2 M 1 POINTS 10 8 12 9 9 H M 1 1 10 5 7 CAT H H M EXERCISES ENO TOPIC 1 Rel. Alg 2 SQL 1 SQL MAXPT 10 10 14 a) Write Relational algebra and Sql query to print all homework results for Ann Smith (print exercise number and points b) Write an Sal query to print the full name of student that has got the maximum number of points for a homework? Print full name and homework number ! 3 - T = = Give 5 factors that Influence Physical Database Design (12pt) 3 Arial T, T QOD % Mashups fro FTTT & = : : 0 4 Give the definition of checkpoint Arial TT TT -T-EE (12pt) 3: 25 T T S - - ilil DQ OD % 1 Mushups fx OSS THE * :P :0 5 Consider the following log: (T,start); (T,R,40);