By clicking the box below, it will function as my signature that I have read and understood the above A reminder for this assignment that abstract list functions are strictly prohibited! Write a function largest palindronde_number init tout) that consumes a list of ten natural numbers, at least one of which is non-zero, where the value of digit count is the maximum number of uses of the digiti and returns the largest palindromic number that can be formed from these digits. Your solution must use accumulative recursion and all recursion used must be accumulative recursion. Samples: Largest palindromic number(0, 04. 10. 4, 0, 0, 0, 0, 0) 43333323111111223333341 Tareest palindromio number (253, 00, 0, 0, 0, 0] => 322131223 Explanation: Notice above in the last example, a digit with an odd maximum number of uses can only have this extra odd digit in the middle otherwise numbers must be paired off at the beginning and end. Thus, if there are multiple digits for which the maximum use number is odd. only one of those digits will be used its maximum number of times. Note: Your final answer shouldn't contain any leading or trailing zeroes unless the answer actually is . (For example, a number like 10 is not a palindrome as the reverse of this number is 1).