Using a loop, and not recursion,, define function sumOdds(n) = 1 + 3 + ... + n. For example, sumOdds(5) = 1 + 3 + 5 = 9. Assume that n is odd.

Add an Execute part that computes sumOdds(n) for n = 1, 3, 5, ..., 25.

 

    [Language: Cinnameg  Kind: program]