Kind of confused of how you find the order of B-tree given bytes of block, key..
 

*a multilevel index using a B-tree is to be made for a file with 600,000 records. A block contains 1500 bytes, a key is 10 bytes, a pointer is 5 bytes and a data record is 100 bytes. * *a)What is the order of the tree?(assume tree node=a disk block)* 600000recordsX100 bytes gives me total...