Consider two Queue implementations. The first uses an array that is tripled in size

whenever the Queue becomes full. The second uses an array that resizes by adding 10

to the size each time the Queue becomes full. Prove using summations that the

amortized runtime for the insert operation is O(1) for the first Queue but not for the

second one. Assume that each Queue starts as an array of size 1. (Hint: Consider N

insert operations where N is a large number.)