In python

Write a recursive function that takes a positive integer n as input. The function outputs the sum of the cubes of 1, 2, ..., to n. For example, on input 3, it should output 32. The function may not use: Loops, lists, sets, or dictionaries. Write it so that it does some error checking: While it can take any number as input, for any number besides a positive integer, it returns 0.

Do the last program again, but now take two inputs a and b, returning the sum of the cubes inbetween a and b (including a and b). For example, on inputs -2 and 3, return 27. Consider various ways to do this