Suppose a B⁺ tree is used for indexing a database file. Consider the following information :

size of the search key field = 10 bytes, block size = 1024 bytes, size of the record pointer = 9 bytes, size of the block pointer = 8 bytes.

Let K be the order of internal node and L be the order of leaf node of B⁺ tree, then (K, L) = ______.