Given the following function:

 1. What problems come up in verifying this function? 2. How many recursive calls are made by the following initial calls?

int Ulam(int num) { } if (num < 2) return 1; else if (num % 2 == 0) return Ulam(num / 2); else return Ulam (3 * num + 1);