In a dynamic array-based implementation of the ADT list, what is the performance of adding an entry at the end of the list when the array is resized? Select one: O A. O(n) O B. O(n) O C. O(log n) O D.O(1)