Consider a dynamic array where the capacity doubles when additional space is needed and shrinks by 50% when the size falls below 1/4 capacity. What will be the amortized big-O of an append() operation where an element is inserted at the end of the array.? A O(n2) B. 0(1) c. O(Ig n) D. O(n)