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. Based on the concepts and techniques talked about to this point in the course, what is the worst$-$case time complexity of physically adding the element to the chain of nodes, assuming the reference to the right spot has already been found?

A$.O(1)$

B$.O(logN)$

C$.O(N)$

D$.O(N^2)$