Given that search key field of a B Tree is 8 by...

Given that search key field of a B Tree is 8 bytes long. The disk block size is 512 bytes, record pointer is 6 bytes and a block pointer is 5 bytes. Then, the order of the B Tree is_____.

25

27

29

30

Hint: 

<div class="tex2jax"></div>

0Comment