What is the primary difference between B trees and B$+$ trees?

B trees are used for indexing, while B$+$ trees are used for storing data records.

B$+$ trees have a higher branching factor than B trees.

B trees support duplicate keys, while B$-$ trees do not

B$-$trees are height$-$balanced, while B trees are not.