5. [ 4 pts] The following B tree has M=4,I=4. Remove 25 from the tree and draw the resulting B tree. When given the option to examine both left and right items, favor the left item first. Answer. 6. [8] Given the hashing function and probing strategy specified below, insert key 3 into each hash table. Note that each hash table contains existing keys and tombstones (marked as -99 ). Hash function: hash (x)=((xx)+x)11 Note: hi(x)=( hash (x)+f(i)) o table_size ; i (probing attempt) =0,1,2,., table_size - 1 A. [2] Linear Probing having f(i)= (i) B. [3] Quadratic Probing having f(i)=(i2) c. [3] Double Hashing having f(i)=i * hash (x), where hash2(x)=7(x7) 7. [4 pts] A 2-3 Tree is implemented as shom in the figures and pseudo-code below. Write pseudo-code for the method findMarl(), which finds and returns the marimum key in the eurrent 2-3 Tree. You may define a helper method if needed. Note: A Node object represents a 2-node or 3-node depending upon key 2 and rightchild value, as show in the figure. Pseudo-Code: Node> : E key1 E key2 Node leftchild Node middlechild Node rightchild boolean leaf // boolean indicating whether the node is a leaf node Tree> : Node root Tree (): root=null E findMax(): // To Be Implemented