computer science algorithm

Analyze the pseudocode below and give the asymptotic worst-case running time of each function in terms of the input value n as a Big-Theta expression. (a) procedure KS_UM 1(n) S leftarrow 0 k leftarrow n while k greaterthanorequalto 1 do for i = 1, 2 ..., k do S leftarrow S + k end for k leftarrow k/2 end while return S end procedure (b) procedure KS_UM 2(n) S leftarrow 0 k leftarrow n while k greaterthanorequalto 1 do for i = 1, 2, ..., n do S leftarrow S + n end for k leftarrow k/2 end while return S end procedure