(Solved): data structure please answer Given that we built a stack using resizing array that is ...

data structure please answer

Given that we built a stack using resizing array that is doubled when full, and using an initial Consider the following pseudocode that uses a stack. What is output for wordX = "ABCDEFGHIJKL"? declare a stack of characters while (there are more characters in the wordX) \{ read a character push the character on the stack if(the stack has 4 characters) \{ while(the stack is not empty) \{ pop a character off the stack write the character to the screen \} \} \} Answer: DEFGHIJKL Given that there is a stack that is built using resizing array. The size is multiplied by 2 when it is full and size is divided by 2 when number of elements $=1/3$ length. Using shallow analysis where we assume each stack element is 8 Bytes only, what is the telda approximation of the size reserved for this stack assume it has $\mathrm{N}$ elements?