The order of a leaf node in B+ tree is the maximum number of (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 and a block pointer is 6 bytes long, What is the order of the leaf node?