What is the time complexity of performing a deep clone of a linked list with $n$ nodes?

$(nlog(n))$

$(2^{{?}^{{?}^{?}}}n)$

$(logn)$

$(n^{{?}^{{?}^{?}}}2)$

$(n)$