In a B-tree,the block size is 512 bytes,search key is 2 bytes ,block pointer size is 6 bytes and record pointer size is 8 bytes.every node contains n-1 record pointers,n-1 search keys,n block pointers.Find out maximum number of search key that can be accommodated in level-0 B-tree?
(a) 32
(b) 31
(c) 30
(d) none