A B$-$tree of minimum degree t $=2$ and of height $3$ will have a maximum of $\_\_\_\_$ keys.

Question $4$ options:

$255$

$188$

$63$

$127$