Enter a positive integer:  You entered 5
odd(5):  start
odd(5):  Making recursive call odd(4)
odd(4):  start
odd(4):  Making recursive call odd(3)
odd(3):  start
odd(3):  Making recursive call odd(2)
odd(2):  start
odd(2):  Making recursive call odd(1)
odd(1):  start
odd(1):  base case, returning 1
odd(2):  After recursive call, returning 3
odd(3):  After recursive call, returning 5
odd(4):  After recursive call, returning 7
odd(5):  After recursive call, returning 9
Odd number # 5 is 9

fact(5):  start
fact(5):  Making recursive call fact(4)
fact(4):  start
fact(4):  Making recursive call fact(3)
fact(3):  start
fact(3):  Making recursive call fact(2)
fact(2):  start
fact(2):  Making recursive call fact(1)
fact(1):  start
fact(1):  Making recursive call fact(0)
fact(0):  start
fact(0):  base case, returning 1
fact(1):  After recursive call, returning 1
fact(2):  After recursive call, returning 2
fact(3):  After recursive call, returning 6
fact(4):  After recursive call, returning 24
fact(5):  After recursive call, returning 120
5 factorial is 120

fib(5):  start
fib(5):  Making left recursive call to fib(4)
fib(4):  start
fib(4):  Making left recursive call to fib(3)
fib(3):  start
fib(3):  Making left recursive call to fib(2)
fib(2):  start
fib(2):  base case, returning 1
fib(3):  Left recursive call came back with 1
fib(3):  Making right recursive call to fib(1)
fib(1):  start
fib(1):  base case, returning 1
fib(3):  Right recursive call came back with 1
fib(3):  After recursive calls, returning 2
fib(4):  Left recursive call came back with 2
fib(4):  Making right recursive call to fib(2)
fib(2):  start
fib(2):  base case, returning 1
fib(4):  Right recursive call came back with 1
fib(4):  After recursive calls, returning 3
fib(5):  Left recursive call came back with 3
fib(5):  Making right recursive call to fib(3)
fib(3):  start
fib(3):  Making left recursive call to fib(2)
fib(2):  start
fib(2):  base case, returning 1
fib(3):  Left recursive call came back with 1
fib(3):  Making right recursive call to fib(1)
fib(1):  start
fib(1):  base case, returning 1
fib(3):  Right recursive call came back with 1
fib(3):  After recursive calls, returning 2
fib(5):  Right recursive call came back with 2
fib(5):  After recursive calls, returning 5
Term # 5 in Fibonacci sequence is 5