Page 501: Chapter 7: Q 17:

Given the following function: int Ulam (int num) {if (num 2) return 1; else if (num % 2 = 0) return Ulam (num/2); else return Ulam (3 * num + 1)} What problems come up in verifying this function? How many recursive calls are made by the following initial calls? cout