Problem 5 14 + 4 + 4 = 12 marks Analyze the following piece of pseudocode and give a tight (O) bound on the running time as a function of n. Show your work. A formal proof is not required, but you should justify your answer (in all cases, n is assumed to be a positive integer). a) s := 0 for i:=1 to n do for j:=1 to i * i S := S + 1 do b) p:= 1 S := 0 for i=1 to n do p := p * 5 for j:=1 to p do S := S + 1 c) s:=n for i:=1 to n s:=i while (s> 1) s:=s/2