What is the best way to analyze the time Complexity of two different recursive functions that call each other.
class test { public: static int f(int x) {