Code in Python language!

Given n positive natural numbers A1,,An, we want to find how many unique sequences X1,,Xn of 0 and 1 are correct solution to i=1nAixi=m for any natural number m. For example: for 3,34,4,12,5,2 and m=9 there are only two sequences: 1,0,1,0,0,1 (13+034+14+012+05+12=9) and 0,0,1,0,1,0(03+034+14+012+15+02=9) Write the function num_of_solutions(elements, m ) that returns how many solutions (sequences of 0 's and 1 's) are there when elements is a list of A1,,,An described above. Tip: You do not need to find the actual solutions, you need just to determine the number of the solutions. You must solve this problem using generative recursion. Sample: \[ \begin{array}{l} \text { num_of_solutions }([3,34,4,12,5,2], 9) \Rightarrow 2 \\ \text { num_of_solutions }([5,5,5,5,5,5], 5) \Rightarrow 6 \\ \text { num_of_solutions }([8], 8) \Rightarrow 1 \end{array} \]