Write a recursive function (no auxiliary functions, for/while loops, STL containers or functions, static/global variables) int productDigits(unsigned int n); Given an integer n, multiply up all the digits in the number and return the product. productDigits(234); productDigits(118); productDigits(52892); // returns 24 // returns 8 (1*1*8) // returns 1440 (5*2*8*9*2) (2*3*4)

In java there must be at least two calls to the function with different arguments and the output must clearly show the task being performed. Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise.  A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks.  Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function…

#python def add_func(a,b): print(f"add_func output for 1 + 2: {add_func(1, 2)}") print(f"add_func output for good + day: {add_func('good',' day')}") (add_func(1,2) = 3, (add_func('good',' day') = "good day"

pythn opython