Q79

Consider a table $T$ in a relational database with a key field $K$. A $B$-tree of order $p$ is used as an access structure on $K$, where $p$ denotes the maximum number of tree pointers in a B-tree index node. Assume that $K$ is $10$ $bytes$ long; disk block size is $512$ $bytes$; each data pointer PD is $8$ bytes long and each block pointer PB is $5$ bytes long. In order for each $B$-tree node to fit in a single disk block, the maximum value of $p$ is