Q$17.$ Assuming h is the tree height and n is the number of keys in a Binary Search Tree, the execution time takes: $(2$ points$)$

$($a$)$ O$($ n $+$ h $)$ time for deletion of an entry

$($b$)$ O$($ n log h $)$ time for inserting an entry

$($c$)$ O$($ log $($n $+$ h$))$ time for searching an entry

$($d$)$ O$($ log h$)$ time for deletion of an entry

$($e$)$ O$($ h $)$time for inserting an entry