Discrete Mathematics

1. What is the best big O characterization of the following algorithm in terms of n?

procedure b ( n : integer )

s := 0

i := 0

while i < n

j := 0

while j < n

s := s + i * j

j := j + 1

i := i + 1

return s