List lst = new LinkedList(); for (int i=0; i< N; i++) lst.add(lst.size(), i);

What is the time complexity of this code snippet ? Assume that LinkedList class is implemented as singly linked list, and contains variables "head" and "size".

NOTE:

Method signature from Javadocs for class LinkedList:

add(int index, E element)

Inserts the specified element at the specified position in this list.

size()

Returns the number of elements in this list.