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