Can someone please help me with this PYTHON problem! please answer with code! the only parts that you need to change have # YOUR CODE HERE

Subset Product

This next one asks you to employ a common recursive pattern that of computing all the subsets of a given set of things. In this problem, you are to determine whether or not an integer P>1P>1 can be computed as the product of any combination of a provided list of integers (where each factor f >0>0 can only be used once).

Examples:

given P=10P=10 , and the list [2, 3, 4, 5], we see that 25=1025=10 , so the answer is yes

given P=81P=81 , and the list [2, 2, 3, 3, 4, 9], 339=81339=81 , so the answer is yes

given P=100P=100 and the list [3, 4, 5, 8, 10], the answer is no

Complete the implementation of the recursive can_make_product, which returns True or False based on whether the argument p can be computed as the product of some subset of the list of integers vals.

In [ ]:

def can_make_product(p, vals): 

 # YOUR CODE HERE 

 raise NotImplementedError() 

. . .

In [ ]:

# (5 points) 

from unittest import TestCase 

tc = TestCase() 

tc.assertTrue(can_make_product(10, [2, 5])) 

tc.assertTrue(can_make_product(10, [2, 3, 4, 5])) 

tc.assertTrue(can_make_product(10, [3, 4, 2, 5])) 

tc.assertTrue(can_make_product(10, [10])) 

tc.assertTrue(can_make_product(81, [2, 2, 3, 3, 4, 9])) 

tc.assertTrue(can_make_product(66402, [2, 4, 5, 12, 17, 25, 31, 63])) 

tc.assertFalse(can_make_product(10, [2, 2, 2, 4])) 

tc.assertFalse(can_make_product(243, [2, 2, 3, 3, 3, 4, 4, 4])) 

tc.assertFalse(can_make_product(81, [2, 3, 5, 9, 11])) 

tc.assertFalse(can_make_product(100, [3, 4, 5, 8, 10])) 

tc.assertFalse(can_make_product(12369, [3, 4, 5, 8, 19, 20, 31]))