Express the worst case run time of these pseudo-code functions as summations. You do not need to simplify the summations.

a)

function(n)

let A be an empty stack for int i from 1 to n

A.push(i)

endfor

endfunction

b) function(A[1...n] a list of n integers)

for int i from 1 to n

find and remove the minimum integer in A

endfor

endfunction 2

c) function(H[1...n] a min-heap of n integers)

for int i from 1 to n

find and remove the minimum integer in H

endfor

endfunction