Write a program that takes a pointer to array of integers. Create a dynamic array of integers through CreateArray () function (without recursion).After that pass it to the sum function to calculate sum of perfect numbers using recursion. NOTE: A perfect number is a number that is numerically equal to the sum of its divisors. For example, 6 is a perfect number because the divisors of 6 are 1,2,3 and 1+2+3=6. int sum (int *array, int size)