I have a function, getSecond(), that returns the second element of a linked list or throws an exception if there is no second element. What is the likely order of this algorithm?\

O(2)

\

O(n)

\

O(1)

\

O(0)

\

O(logn)

I have a function, getSecond(), that returns the second element of a linked list or throws an exception if there is no second element. What is the likely order of this algorithm? O(2) O(n) O(1) O(0) O(logn)