Using Python language.

Solve this using Recursion technique.

Using each of below techniques, define a mul_of_odds (n) function which receives an integer number n, calculates and returns the result of multiplications of the first n positive odd integer numbers moda(n). Example for moda(3) is as below. modd (3) = 1 x 3 x 5 = 15 Recursion (3 markah