Calculate the running time of the following algorithm and establish the order of growth.

Algorithm Sum (); Result := 0; for i := 1 to n do for j := 1 to n do for k := 1 to j do Result ++; Output Result ;