In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is Group of answer choices n n$/2$ log$(2$n$)$ log$(2$n$)-1$