python3 please make sure code is recursive

-lf there are Write a recursive function paren-checker, that takes in a string and returns True if it is a nesting of zero or more correct pairs of parentheses like "( any characters in the expression you should return false, even if the order of the parentheses is correct or Hint: check the first and last characters, and then recursively check what's between them. def paren_checker(string): >>paren_checker("O") True >>paren_checker("00") False >>> paren-checker"(0)") False >>paren_checker((x))") False >paren_checker(" (0)") True >>paren_checker("(x)") False >>paren_checker() True gif YOUR CODE GOES HERE #