Draw a non$-$recursive procedure capable of reversing a single linked list of $n$ elements, which runs in $O(n)$ time. Can the same be achieved in $(n)$ time? If so$,$ construct it$.$