What is the worst case time complexity for the algorithm q(n) below? State your answer as the best Big-Oh expression? To solve this problem, youll need to find the time complexities of s(n) and t(n), and these functions are also defined below.

long q(int n){ if(n <= 0){ return n; } else{ t(n); return q(n / 2); } } void s(int n){ int i = 1; while(i <= n){ cout << "*"; i = i + 1; } cout << endl; } void t(int n){ if(n <= 0) return; else { s(n); t(n - 1); return; } }

(a) O(log(log n)) (b) O(log n) (c) O(n) (d) O(n log n) (e) None of the above