Indexing Formula I Starter Quiz-2

In a B+ tree, if the search key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _____.

In a database file, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 6 bytes and the block pointer is 7 bytes. Find the largest possible order of a non-leaf node in B+ tree implementing this file structure ?{order defines maximum number of keys present}