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.ut ofuestionSelect one or more:O a$.$ Delete of a leaf node is in O$(1)$ b$.$ FindMax is in O$($log H$)$O c$.$Delete of a $2$ children node is in O$($H$)$O d$.$ Delete of a one child node is in O$($log H$)$ e$.$ Insert $($of a new element$)$ is in O$($H$)$O f$.$FindMin is in O$($H$)$