I WANT THIS QUESTION DONE IN PYTHON AND IT HAS TO BE RECURSIVE

Given an integer array nums, determine if it is possible to divide nums in two groups, so that the sums of the two groups are equal. Any of the two groups can be empty. Feel free to write a helper (recursive) method. Examples: nums = [4, 4] true nums = [5, 2] + false nums = [2, 5, 3] + true nums = [-2, 2] + true nums = [] true nums = [10, 5, 8] = false nums = [-5, -2, 7] + true nums = [2, 7, 3, 1, -1] true # You are allowed to modify the code in the cell as you please, # just don't change the method signature. # Feel free to write a helper (recursive) method. That is, it's OK if can_divide # is not a recursive method as long as it calls another method that Is recursive def can_divide(nums)