In Example $14\mathrm{.}17$ we suggested that it would be possible

to borrow keys from a nonsibling to the right $($or left$)$ if we used a more complicated algorithm for maintaining keys at interior nodes. Describe a suitable

algorithm that rebalances by borrowing from adjacent nodes at a level, regardless of whether they are siblings of the node that has too many or too few

key$-$pointer pairs.