Calculate the running time and establish the order of growth for the following algorithm. Sum (); = 0; for i:=1 to 2n do Algorithm Result for j = 1 to i+1 do for k=1 to 2j do Result ++; Output Result; Hint: 1 +2+...+ n = n(n+1)(2n+1) 6