(a) what is the worst case, average case, and best case running time of insertion into slot a[0] of an (unsorted) array a containing n integers, representing a stack? give θ bounds and explain your answer. (b) what is the amortized running time of insertion of n integers into an initially empty array a, representing a stack, if every insertion takes place at a[0]? give a tight o bound and explain your answer.