Question 17 (10 points) Swed What is the worst case running time of the following pseudocode functions in Bie-o notation in terms of the variable n. Choose the tightest bound possible (in other words, giving 012") as the answer to every question is not likely to result in many points). There are 4 functions so write the Big-O complexity in space below. void guess(int n, int x, int y) { for (int i = 0; i 0; i--) { for (int j = 0; j 1X n = n/2 S++; } return s } void guess(int n, int m) { if (m > n) return; cout