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 an array is used as the underlying data structure for the collection, the right spot is identified by a legal index value in the array. 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 array, assuming the index of the right spot has already been found? A. O(N2) B. O(N) C. O(logN) D. O(1)