Consider a $3-$level index $($level$-3$ is a single block$)$ with index field the ordering field of relation R$.$ The block size is $4096$ Bytes, the index field is DATETIME type of $8$ Bytes, each pointer takes $8$ Bytes, too. Let f be the maximum number of pointers an internal node $($a block$)$ of the index can contain $($a block must be able to accommodate f pointers and f $1$ keys because the key of the first index entry does not need to be stored$).$ Please answer the following questions