Database-Management-System

Consider B+ − tree of order d shown in figure?
(A) B⁺ − tree of order d contains between d and 2d keys in each node.
(a) Draw the resulting B⁺ − tree after inserted in the figure.

(b) For a B⁺ − tree of order d with n leaf nodes, the number of nodes accessed during a search is 0(-).