Given a Binary Search Tree, BST$,$ of height $H.$ In terms of $H,$ the complexity in time $($big$-$

Oh notation$)$ of the BST operations are as follows.

Select all that apply:

a$.$ FindMin is in $O(H)$

b$.$ FindMax is in $O(logH)$

C$.$ Delete of a one child node is in $O(logH)$

d$.$ Insert $($of a new element$)$ is in $O(H)$

e$.$ Delete of a leaf node is in $O(1)$

f$.$ Delete of a $2$ children node is in $O(H)$