Write a recursive function that returns True if the numerical array passed as input is palindrome, and False otherwise. An array is palidrome if its elements, when flipped, produce an array that is identical to the original one. For example: [1,2,3,2,1] is palindrome [1,2,3,4,3] is not palindrome Fill in the following code skeleton. It is composed of four parts: three base cases and the recursive call. Write code for all the parts. Assume that the input arrays can have any size, and that the elements are always positive integers.

Digital Sum The digital sum of a number n is the sum of its digits. Write a recursive function digitalSum(n:int) -> int that takes a positive integer n and returns its digital sum. For example, digitalSum (2019) should return 12 because 2+0+1+9=12. Your Answer: 1 # Put your answer here 2 Submit

Write a recursive function for printing n box shapes [ ] in a row. Hint: Print one [], then print n - 1 of them. Complete the following file: boxes.cpp 1 #include 2 using namespace std; 3 4 void print_boxes(int n) 5 { 6. if (. . .) { . cout << ; } 7 8 print_boxes(. . .);| 9 }

Use C++