Solution

The correct answer is option 1.

Solution :

Given data,

Block size = 1 K bytes = 1024 bytes

Data Record pointer (r) = 7 bytes

Value field (v) = 9 bytes

Block pointer (p) = 6 bytes 

 Let ,the order of leaf node of B+ tree = m 

Now, for B+ tree ,

r * m + v * m + p <= 1024

or,  7m + 9m + 6  <= 1024

or,16m + 6 <= 1024

or, 16m <= 1018

or, m <= 63