1.Following key values are inserted into B+ tree where each node have 2 key values .The sum of keys present at height 1 (height is at 0) is 8,5,1,7,3,12,9,6 .
2.In a database field the search key field is 9 bytes long the block size is 512 bytes , a record pointer is 6 bytes and block pointer is 7 bytes .The largest possible order of a non leaf node in B+ Tree implementing this file structure{order defines max no. of keys present} is