Recall that B$-$Trees were designed for data that are too large to fit in main memory. $$If our data did fit in main memory, would a B$-$Tree of order $2($ie$,$ m$=2)$ be a good choice for a Dictionary that supported Find, Insert, and Delete operations?

Group of answer choices

No$,$ because B$-$Trees of order $2$ could have O$($n$)$ height.

Yes, because B$-$Trees are simple to implement, requiring no rotations.

Yes, because B$-$Trees of order m have log$\_$m height.

No$,$ because B$-$Trees store all of their data at the leaves.