Enter two positive integers:  You entered 4 and 3
exp(4, 3):  start
exp(4, 3):  Odd case, making recursive call to exp(4, 2)
exp(4, 2):  start
exp(4, 2):  Even case, making recursive call to exp(4, 1)
exp(4, 1):  start
exp(4, 1):  Odd case, making recursive call to exp(4, 0)
exp(4, 0):  start
exp(4, 0):  base case, returning 1
exp(4, 1):  After recursive call, multiplying base 4 by 1 to return 4
exp(4, 2):  After recursive call, squaring 4 to return 16
exp(4, 3):  After recursive call, multiplying base 4 by 16 to return 64
4 to the 3 is 64
pascal(4, 3):  start
pascal(4, 3):  Making left recursive call to pascal(4, 2)
pascal(3, 2):  start
pascal(3, 2):  Making left recursive call to pascal(3, 1)
pascal(2, 1):  start
pascal(2, 1):  Making left recursive call to pascal(2, 0)
pascal(1, 0):  start
pascal(1, 0):  base case, returning 1
pascal(2, 1):  Left recursive call came back with 1
pascal(2, 1):  Making right recursive call to pascal(1, 1)
pascal(1, 1):  start
pascal(1, 1):  base case, returning 1
pascal(2, 1):  Right recursive call came back with 1
pascal(2, 1):  After recursive calls, returning 2
pascal(3, 2):  Left recursive call came back with 2
pascal(3, 2):  Making right recursive call to pascal(2, 2)
pascal(2, 2):  start
pascal(2, 2):  base case, returning 1
pascal(3, 2):  Right recursive call came back with 1
pascal(3, 2):  After recursive calls, returning 3
pascal(4, 3):  Left recursive call came back with 3
pascal(4, 3):  Making right recursive call to pascal(3, 3)
pascal(3, 3):  start
pascal(3, 3):  base case, returning 1
pascal(4, 3):  Right recursive call came back with 1
pascal(4, 3):  After recursive calls, returning 4
pascal() invoked 7 times.
Number in row 4 col 3 of Pascal's triangle = 4