Code in C/C++

Write a function that takes in inputs int *p, int n, where p is (points to) an array of size n. You can assume that the array has been generated correctly. The function outputs (returns) an integer that is suppose to be the sum of the min element and the max element. For example, if the array is (1, 2, 3, 4, 5, 6), then the min element is 1, and the max element is 6. So for this case, your function should return 7. Of course, your function needs to solve the general problem, not just this particular instance. Write a boolean function that determines whether an array is symmetric or not. The function gets inputs int *p and int n, where p is a pointer to an array of size n. The function determines whether the array is symmetric. You can add inputs to the function of your own choice. (This is not necessary.) Any method that correctly solves the problem is acceptable. Recall that the definition of symmetric: an array is symmetric if it is the same whether you read from the top or from the end. E.g. [1, 2, 3, 2, 1] is symmetric, but [1, 2, 3, 2] is not. You should name these functions and specify their inputs and outputs. Please do not name the functions with bad tastes