$($b$)$ Show how the following values would be inserted into a red$-$

black balanced tree, and how they would be inserted into an

AVL$-$tree. Which balanced tree structure supports more efficient

searching in this case?

$13,36,74,58,75,80,93$

$($c$)$ Alice's ElGamal public key modp