Challenge: Iterative factorial

Finish the provided factorial function, so that it returns the value $n!$. 

Your code should use a for loop to compute the product $1 \times 2 \times 3 \times ... \times n$. If you write the code carefully, you won't need a special case for when $n$ equals $0$.