What happens if a recursive function lacks a base case?
It returns 0
It executes faster
It results in a stack overflow
It results in an infinite loop without error