Using the best algorithms that we have seen in class, what is the worst case runtime of searching for an item in an UNSORTED list?

Question $44$ options:

O$($n$)$ if the list is a linked$-$list and O$($log$($n$))$ if the list is an array

O$($n$)$

O$($n$2)$

O$($log$($n$))$ if the list if a linked$-$list and O$(1)$ if the list is an array

O$($log$($n$))$

O$($n$2)$ if the list is a linked$-$list and O$($n$)$ if the list is an array