int product(int a, int b) { int sum = 0; for (int i = 0; i < b; i++) { sum += a; } return sum; }

Hint: in here you should give an answer for the big-Oh in terms of a and b.

The following code sums the digits in a number. What is its big 0 time?

int sumDigits(int n) { int sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }

Hint: in here you should give an answer for the big-Oh in terms of n.