What is the computational complexity of the operation COPY provided below expressed in terms of the size of the input list? Discuss both the array and the pointer implementations of the List ADT. Your estimates should be tight in both cases, i.e. the times spent on the execution of the operation COPY should be both "big oh" and "big omega" of your functions. Justify your answer.

procedure COPY( K: LIST; var L: LIST ); var p: position; begin MAKENULL(L); p := FIRST(K); while p <> END(K) do begin INSERT(RETRIEVE(p, K), END(L), L); p := NEXT(p, K) end end; { COPY }