Show how the following simple prefix B+ tree changes after the addition of node (Assume the index block size is 2):

1. Show how the following simple prefix B+ tree changes after the addition of node (Assume the index block size is 2): (15 points) ITEMIZE-JAR KE CAMFROST OL VIC FROST-HARY KELLY-LARRY VICTOR-ZHOU ADAM-CAGECAMP-FOLK 4 2 Write a hush function to return the 10s digit of a 4-digit key, e.g., for a key of 9183, return 8. (15 points) 3 Use the following values: 66 7 87 90 126 140 145 153 177 285 393 395 467 566 620 735 Store the values into a hash table with 20 positions, using the division method of hashing and the linear probing method of resolving collisions. (15 points)