Write a recursive method that takes an integer n as a parameter (where n 1). The method should compute and return the product of the n to power 3 of all integers less or equal to n. Then, write the main method to test the recursive method. For example: If n =4, the method calculates and returns the value of: 13 * 23* 33 * 4+= 13824 If n =2, the method calculates and returns the value of: 1 * 2 = 8