What are the worst$-$case and average$-$case time complexities of the insertion of a key into a binary search tree?

$1$ point

O$($log n$)$ and O$($n$),$ respectively

O$($n$)$ and O$($n$),$ respectively

O$($n$)$ and O$($log n$),$ respectively

O$($n$)$ and O$($n log n$),$ respectively