a) The ExtendableVector doubles its capacity everytime it gets full. Consider a different implementation of an ExtendableVector that adds 10 to its capacity instead of doubling it every time it gets full. Would this "increase-by-10" implementation be less or more efficient compared to the "double-the-capacity" implementation? [Hint: what would be the worst-case and amortized-case complexity of the two implementations?] b) Draw a sketch of the stack implemented using an ExtendableVector after each of the following steps: ExtendableVectorStack s: s.push(11); s.push(19); s.push(6); s.push(12): s.push(13); Assume that an ExtendableVector starts with default capacity 1