Problem: Write a C++ program that will implement and test the four functions described beloww that use pointers and dynamic memory allocation The Functions: You will write the four functions described below. Then you will call them from the main function, to demonstrate their correctness. 1. isSorted: takes an array of integers and its size as arguments. It should return true if the elements of the array are already in ascending order, and false if they are not. Do not use square brackets anywhere in the function, not even the parameter list (use pointers instead) 2. chain: The following function uses reference parameters. Rewrite the function so it uses pointers instead of reference parameters. When you test this function from the main program, demonstrate that it sets the values of the variables passed into it. double chain (int totallnches, int &feet, int&inches) feet = total Inches/ 12; inches = total Inches% 12; return feet 3.49+inches*.30; . grow: takes an array of integers and the array's size as arguments. It should create a new array that is twice the size of the argument array. The function should copy the contents of the argument array to the new array so that each element from the first array occurs twice consecutively in the second array. For example, grow(x,3) wherex is (4,5,63 should return (4,4,5,5,6,6.The function should return a pointer to the new array