A Dynamic Array (abbreviated as DArray) is a type of array that permits the insertion and deletion of elements at the end to dynamically adjust its size. DArray $D$ maintains three crucial attributes, including the underlying array $D.data$, the logical data size $D.size$, and the actual array capacity $D.capacity$. The invariant $D.size \le D.capacity$ holds at any given moment. The $Insert(D,x)$ operation appends the element $x$ to the end of $D.data$. In case $D.size = D.capacity$, it triggers a call to $Resize(D)$ before appending $x$, where $Resize(D)$ allocates a new and larger array, moves all the data to it, increases the value of $D.capacity$, sets up $D.data$, and finally frees the old array. Two implementations of $Resize(D)$ are provided: $ResizeA(D)$ increases $D.capacity$ by a constant (e.g., 10) while $ResizeB(D)$ doubles $D.capacity$ each time.

To initialize DArray $D$, we set $D.size=0$, $D.capacity=1$, and allocate a size 1 array to $D.data$. Assuming that both allocating and freeing arrays of length $n$ take $O(n)$ time, and moving a single element takes $O(1)$ time, please select the correct description(s) below.