Given a Binary Search Tree, BST$,$ of height H$.$ In terms of H$,$ the complexity in time $($bigOh notation$)$ of the BST operations are as follows.

Select one or more:

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

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

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

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

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

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