Q1.5

MCQ1 mark, −0.25

In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is