4 marks] Analyze the following pseudocode and give a tight () bound on the running time as a function of n. You can assume that all individual instructions are elementary (i.e. take time in (1)). Show your work. k:=n;s:=0; for i=2k+1 to 5k do s:=s+1 od k:=2+k; for i=1 to k do for j=1 to logi do s:=s+ij