Let us consider a Binary Search Tree, BST$,$ of height H$.$ In terms of H$,$ the complexity in time $($big$-$Oh notation$)$ of the BST operations is as follows.Select one or more:O a$.$Printing BST using the pre order traversal is in O$($log$($logH$))$ b$.$Printing BST using the in order traversal is in O$($log H$)$ C$.$Delete of a one child node is in O$($H$)$ d$.$ Delete of a leaf node is in O$($H$)$U e$.$ FindMin is in O$($H$2)$O f$.$FindMax is in O$($H$)$