The orderofa leaf node in a B+ tree is the maximum numberof (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long andablock pointeris 6 bytes long, what is the orderofthe leaf node?

A

63

B

64

C

67

D

68