my ID is 18 05 03 401

there are 10 million records

i use 5 byte pointers

key size is 19bytes

record size is 512bytes

blok size is 18MB

so can you find max or min height of B Tree

For example, if your ID is "10 07 06 013" then you will solve the question according to the given parameters below: 2-) The given ID is an odd number, this means you must find the minimum height of the B+ Tree. b.) The given ID ends with 13, this means you have (13* 10 million ) 130 million records. C-) The given ID is an odd number, this means you will use 5 byte pointers. d.) key size is 10 + 13 - 23 bytes e) Record size is 13*512 - 6656 bytes. F-) Block size is 10 MB