Identfy Best, Average, and Worst case complexity with respect to number of comparisons for:

Median of a Sorted Array

Response Format

$O(1)=a$

$O(logn)=b$

$O(n)=c$

$O(nlogn)=d$

$O(n^2)=e$

$O(2^n)=f$

$O(n!)=g$

Use the corresponding letter for the $O($#$)$ value, separated by a space

#$,$ #$,$ #