$2$A: Match the average$-$case time complexity of the search, insert and delete operations with each data structure:

A: $\backslash$Theta $(1)$ search, $\backslash$Theta $(1)$ insert, $\backslash$Theta $(1)$ delete

B: $\backslash$Theta $($n$)$ search, $\backslash$Theta $(1)$ insert, $\backslash$Theta $(1)$ delete

C: $\backslash$Theta $(1)$ search, $\backslash$Theta $($n$)$ insert, $\backslash$Theta $($n$)$ delete

D: $\backslash$Theta $($log$($n$))$ search, $\backslash$Theta $($log$($n$))$ insert, $\backslash$Theta $($log$($n$))$ delete

E: $\backslash$Theta $($log$($n$))$ search, $\backslash$Theta $($n$)$ insert, $\backslash$Theta $($n$)$ delete