Discrete Mathematics

How many steps does the following algorithm take?

procedure a

s := 0

i := 0

while i < 3

j := 0

while j < 4

t := t + i * j

j := j + 1

i := i + 1

return t