For the following list :

$46,43,55,34,24,25,60,91,98,70,39,41,92,64,82$

a$.$ construct $($draw$)$ the $(2,4)-$tree

b$.$ construct $($draw$)$ the red$-$black tree $($ by converting the tree from $($a $))$

inserting their elements successively, starting with the empty tree.