A file with $100,000$ records is indexed with $B+$ tree. If the size of a memory

block is $2K$ bytes, the size of a key is $4$ bytes, the size of a pointer is $4$ bytes,

what is the minimum possible height of the $B+$ tree index. Height is always

greater than equal to $1.$

Hints: No records are store in the nodes, only keys are stored. The sizes of the

pointers are same, irrespective of they point to a node of a record.