Question 2 Consider the linear hash structure below. Show the new structure (including Next, Level, N) after inserting each of the following records accumulatively in that order. Assume that adding a new overflow page will trigger splitting a bucket. 1. a record with the search key 7 (i.e., binary 111) 2. a record with the search key 2 (i.e., binary 010) 3. a record with the search key 1 (i.e., binary 001) Note that you need to show the new structure of inserting each of above records. Overflow pages Next=3 Level=0,N=4 H HO 0000 000 0001 001 0010 010 0011 011 0100 100 0101 101 0110 110 Primary pages 32*, 8* 9*, 25*, 1*, 9* 42*, 18*, 10*, 34* 31*35*,7*11* 44*, 36* 5*, 29* 14*, 30*, 22*, 38* 43* 46* Question 2 Consider the linear hash structure below. Show the new structure (including Next, Level, N) after inserting each of the following records accumulatively in that order. Assume that adding a new overflow page will trigger splitting a bucket. 1. a record with the search key 7 (i.e., binary 111) 2. a record with the search key 2 (i.e., binary 010) 3. a record with the search key 1 (i.e., binary 001) Note that you need to show the new structure of inserting each of above records. Overflow pages Next=3 Level=0,N=4 H HO 0000 000 0001 001 0010 010 0011 011 0100 100 0101 101 0110 110 Primary pages 32*, 8* 9*, 25*, 1*, 9* 42*, 18*, 10*, 34* 31*35*,7*11* 44*, 36* 5*, 29* 14*, 30*, 22*, 38* 43* 46*