Consider a B+ tree with a block size of 2K bytes. The data record pointer is 4 bytes, the Value field is 12 bytes long. The order of a leaf node is defined as the maximum number of (key, record pointer) pairs B+ tree can hold. If the block pointer is 8 bytes long then what is the order of the leaf node in a given tree?