I'm posting this 2nd time. Please answer asap.

a. Construct a B+ tree of order n=4 for the following search key values inserted in the given order: 80,70,90,95,75,85,98,72,78,88,93,100. Each time there is a split, a new B+ tree must be drawn. b. Construct a hash index on attribute "Product Code" of the "Product" table. The hash index has 5 buckets, each capable of holding a maximum of 2 index entries. Bucket overflow is resolved using forward chaining. The "Product" table is provided below: Steps involving hash function is summarized below: - Find the sum of the ASCII values for each character in the given Product Code string. - Square the sum. Extract the two middle digits from the squared result. If the squared result has n digits then you take the (n//2)-th and ((n//2)+1)-th digits. - Then, calculate the sum of the two extracted digits and take the remainder after dividing the sum with the number of buckets in the hash index. Consider the example below: - For Product_Code = 'GX2', the ASCII values of the corresponding characters, ' G ' =71, ' X ' =88 and 2=50. The sum of the individual ASCII values =71+88+50=209. - Square of the sum 209=(209209)=43681. This result contains n=5 digits. So the (5//2)-th and ((5//2)+1)-th digits of the squared sum are 3 and 6 respectively. Sum of the middle digits =3+6=9. Remainder =9%5=4. So the index entry of ' GX2 ' will be stored in bucket 4