(Textbook Database: The complete book ullman, p. 647, Q. 14.2.4) What are the minimum numbers of keys and pointers in B+tree (i) interior nodes and (ii) leaves, when:\

a) n = 10; i.e., a block holds 10 keys and 11 pointers.

b) n = 11; i.e., a block holds 11 keys and 12 pointers.