0Calculate the worst-case time complexity of searching for an element in a singly linked list with 'n' elements.AO(log 1)BO(n)CO(1 log)DO(1) Correct answer: B ExplanationIn the worst case the element is the last or absent, so every node is visited: O(n). Join the discussion Report an error Share