What is the time complexity of performing a deep

clone of a linked list with $n$ nodes?

$(n^2)$

$(nlogn)$

$(n)$

$(2^n)$

$(logn)$

None of the other answers are correct.