Please provide the dynamic array stack structure (you must mention the size and capacity at each step) after the following lines of code are executed. You should assume that the initial capacity is 1 and that after pushing each new element, the algorithm checks the size. If size == capacity, the capacity is doubled, and all the elements are copied to the new memory location.

values = Stack() for i in range( 15 ) : if i % 3 == 0 : values.push( i ) elif i % 4 == 0 : values.pop()

You don't need a table, you can format your answer like so:

values = [ ] size = , capacity =

Please provide the dynamic array stack structure (you must mention the size and capacity at each step) after the following lines of code are executed. You should assume that the initial capacity is 1 and that after pushing each new element, the algorithm checks the size. If size == capacity, the capacity is doubled, and all the elements are copied to the new memory location. values - Stack() for i in range( 15 ) : if i % 3 == 0 : values.push( i ) elif i % 4 == 0 : values.pop()