For these 2 questions what is the asymptotic

worst-case running time as a function of the

input size n. give answer in theta notation.

Question 16 int function 16 (int n) { int count = 0; for (int i = 1;i } for (int i = n; i >= 1; i = 1/3) { count++; > return count: 3 Question 17 int function 17 (int n) int count = 0; for (int i = 1;i } for (int i = 0; i<><><>