In the array$-$based heap implementation, in a worst case, the method add has efficiency

Group of answer choices

O$($log n$)$

O$($n$)$

O$(1)$

O$($n log n$)$