why does the issue or error in the problem above occur? no issue occurs; the function correctly calculates the th triangular number. the recursive function has no base case, so it never stops calling copies of itself. the recursive function has no base case, so it never calls a copy of itself.