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. == 0: values = Stack() for i in range( 15 ) : if i % 3 values.push( i ) elif i % 4 0: values.pop() == You can type the answer in the Canvas box in the following format (there is no need to spend time in drawing tables): values = [ ] size capacity =