A tail-recursive function is one where:
There are no base cases
It uses more memory than normal recursion
The recursive call is the very last action of the function
It only works for even numbers