For this Question: Given two numbers m and n, multiply them using only "addition" operations.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Multiply()</b> that takes the integer M and N as a parameter.

Constraints: 
1 ≤ T ≤ 100
0 ≤ M, N ≤ 100Return the product of N and M.Sample Input
2
2 3
3 4

Sample Output
6
12, I have written this Solution Code: def multiply_by_recursion(n,m):
  # Base Case
  if n==0 or m==0:
      return 0
  # Recursive Case
  if m==1:
      return n
  return n + multiply_by_recursion(n,m-1)
# Driver Code
t=int(input())
while t>0:
   l=list(map(int,input().strip().split()))
   n=l[0]
   m=l[1]
   print(multiply_by_recursion(n,m))
   t=t-1, In this Programming Language: Python, Now tell me if this Code is compilable or not?