Question $15$

How many duplicate keys $($non$-$unique keys$)$ will be present in a $B+$ Tree with $n=3,I=50$ and height$=2($has levels $0,1,2)?$ Assume unique values are inserted$)$ and the computed height is $0-$based, i$.$e$.,$ 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