(Solved): Indexing and Query Processing (_/ 23) Consider an initially empty relation Student where the stud ...

Indexing and Query Processing (_/ 23) Consider an initially empty relation Student where the studentID is the primary key. Tuples with the following student IDs are inserted sequentially to the relation: 7,5, 11, 23, 15, 41, 35, 10, 9, ... (a) Consider a B+-tree on the attribute of student ID as a primary index of the relation: The index fan-out p = 3. The underlying data file has a blocking factor pl = 2. When splitting an overflow leaf node with an odd number of tuples into two, make the first node bigger. i. (8 points) Insert the following sequence of numbers: 7, 5, 11, 23, 15, 41, 35 Draw the snapshots of the B+-trees after the insertion of 11, 15, 35, respectively. ii. (1 point) After the insertion of 35, how many blocks should one access to report the record with studentID=23 using the constructed B+-tree?