Consider inserting six elements into an empty binary search tree $($BST$)$ by calling the Tree$-$Insert procedure six times.

$6,5,4,3,2,14,3,5,2,6,13,2,5,1,6,42,1,5,3,6,4$ TREE$-$INSERT $(x,z)$

$ifx=$ NIL

$x=z$

return

$ifz.$key

Which $of$ the given insertion orders will result

$6,5,4,3,2,1in$ a $BST$ with the maximum height?

$4,3,5,2,6,1$

Which $of$ the given

$3.3,2,5,1,6,4$ insertion orders will result $in$ a $BST$ with the minimum

$4.2,1,5,3,6,4$ height?