Adding a new element to an ordered collection (like an indexed list) can be thought of as a two-part process 1) Find the right spot, then (2) physically add the element If a chain of linked nodes is used as the underlying data structure for the collection, the right spot is identified by a reference to a node in the chain. Assuming the reference to the right spot has already been found what is the worst-case time complexity of then physically adding the element to the chain of linked nodes? A. O(1) B. O(log N) C. O(N) D. O(N^2)