What is the greatest number of unique keys a perfect $B$ Tree with $n=3,1=50$ and height $=2($has levels $0,1,2)$ can have $($Assume unique values are inserted$)?$ Assume $0$ based height. A tree with a single root node has a height $=0.$

$n=$ maximum children a node can have

I $=$ maximum keys a leaf node can have