$.($a$)$ Insert into an empty Binary Search Tree $($BST$),$ entries with ordered keys: $30,40,24,58,$

$48,26,11,13.$ Thus, draw the resultant BST after each insertion? $(8$ pts$).$

$($b$)$ How many different Binary Search Trees $($BSTs$)$ can store the ordered keys in $($a$)$ above? $(3$pts$).$

$($c$)$ How many different Binary Search Trees $($BSTs$)$ can store the ordered keys: $1,2,3?(3$pts$)$