How many duplicate keys $($non$-$unique keys$)$ will be present in a B$+$ Tree with n$-3.1-50$ and height$-2($has levels $0,1.2)?$ Assume unique values are inserted$)$ and the computed height is O$-$based, i$.$e$.,$ a tree with a single root node has a height ~ On $-$ maximum children a node can have $1=$ maximum keys a leaf node can have