PYTHON CODEProblem 3

[30 points] Count Expressions Given an integer array nums, and an integer target, write a function that determines how many expressions are possible which evaluate to target adding binary operators (not unary) +, -, and * between the digits in nums. Feel free to write a helper (recursive) method. Examples:

nums = [1, 2, 3] and target = 6 2 (expressions: 1 + 2 + 3, 1 * 2 * 3)

nums = [1, 2, 5] and target = 7 1 (expression: 1 * 2 + 5)

nums = [0, 0] and target = 0 3 (expressions: 0 - 0, 0 + 0, 0 * 0)

# 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 count_expressions

# is not a recursive method as long as it calls another method that IS recursive

def count_expressions(nums, target):

return 0

# Your test cases go here