(g) Assume that the initial size of a vector is 1 and you want to insert 32 items in the vector. If there is no enough memory then a resize function is called and it increments the amount of memory by adding memory for 10 more items to the vector.

(h) How many times should the resize function be called to place all the items in the vector and keep extra space for more elements?

(i) How many additional copy operations are performed to place all the items into the vector?

(j) What is the amortized (average cost) of one insert (push_back) operation?

(k) Provide answers to all the questions above when the input size of the vector is n.