Give the big-Oh characterization, in terms of n, of the running time of the pseudocode loops shown below:

b ? 1

while n > 0 do

b ? b + (5* n)

n ? n / 2

and

k ? 0

for i ? 1 to n^2 do

for j ? 1 to 5n do

k ? k + i