An order d$=23$ B$+$ tree with fill factor $80\%$ can contain nodes with up to how many pointers?

Choice $1$ of $4$:$24$

Choice $2$ of $4$:$31$

Choice $3$ of $4$:$47$

Choice $4$ of $4$:$60$

Grading comment:

Q$3\mathrm{.}2$

What do the inner nodes in a B$+$ tree index contain?

Choice $1$ of $5$:Records

Choice $2$ of $5$:Non$-$Deleted Keys

Choice $3$ of $5$:Non$-$Deleted and Deleted Keys

Choice $4$ of $5$:Values

Choice $5$ of $5$:Tables