Give a tight asymptotic run time analysis ( notation) for the following pseudo-code snippet: L-new linked list containing the values (1, 2, ..., n) for i -1 to n do p - L.head for j 0 to i-1 do pp.next print p.value