What is the primary advantage of using a B$-$tree over a binary search tree?A$)$ Faster search operationsB$)$ Better balanceC$)$ Reduced memory usageD$)$ Efficient disk read$/$write operations