Consider the following list of items: $($:$32,24,17,47,53,24,19,8,32,26$:$)$

$($a$)(8$ pts$.)$ Build a balanced $2-3$ ST by inserting the above items one after another

in this order starting from an empty tree. For each item inserted, indicate where

it goes first, then if an adjustment need to be made to the tree, redraw it before

inserting the next item.

$($b$)(4$ pts$.)$ Delete $19$ from this tree. Indicate any merges, key borrowing, and splits

during the process.