This all in the question I think page size is 1k

Question 4 A file with 1,000,000 records has a B+ tree primary index. Calculate the possible minimum and maximum height of the B+ tree index. Use the following information: record size: 100 bytes key size: 8 bytes pointer size: 8 bytes bock size: 4 K bytes. Hint: The minimum height happens when (almost) all index and data nodes are full. The maximum hight happens when (almost) all index and data nodes are half full (and the root may have only two children