Consider a table T in a relational database with a key field. A B-tree of order p is used as an access structure on key field. Key field is 8 B bytes long, disk block size is 4096 bytes, each data...

I need the answer as soon as possible

Extracted text: Consider a table T in a relational database with a key field. A B-tree of order p is used as an access structure on key field. Key field is 8 B bytes long, disk block size is 4096 bytes, each data pointer is 16 B bytes long and each block pointer is 4 bytes long. In order for each B-tree node to fit in a single disk block, the maximum value of p, where p denotes the maximum number of tree pointers in a B-tree index node, is