karrriee5430 karrriee5430 08-03-2024 Mathematics contestada In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is: a) log(n) b) n c) log(2n) d) n²