The time required to search an element in a linked list of length n is

Select one:

a$.$ O $($log n$)$

b$.$ O $(1)$

c$.$ O $($n$)$

d$.$ O $($n$2)$