Suppose we have a B tree $($order $=$ m$,$ height $=$ h$)$ at its full capacity.Now we decided to index the same set of keys using an order m B$+$ tree.What is the height of the B$+$ tree? If we are doing a ranged search, which search tree is faster? h$-1$; B$+$ tree is fasterO h$+1$; B$+$ tree is fasterOh$-1$; B tree is faster h$+1$; B tree is faster