Write a $C++$ function called grodArry that takes a reference to an integer array called ere and does the following:

Prints "Good" if there is an element in the array, called "BigNumber," whose value equals the sum of all odd elements $($excluding itself$).$

Prints "VeryGood" if you can swap the "BigNumber" with any other element to make the array a palindrome $($if the array is printed from left to right or printed from right to left the result is the same$).$

Otherwise, prints $"$NO$".$

For example:

For the array arr $=[1,3,7,3],$ the outpot is "Good" because arr$[2]=3$ ss equal to the sum of all odd elements $.$

For the amray ar $=[1,3,1,3,1],$ the output is "VeryGood" because anr$[4]-8$ is equal to the sum all odd elements. Additionally, swapping it with am$[2]$ makes the array a palinfrome

For the array arr $[1,2,3,4,5],$ the output is $"$NO$"$ because there is an BigNumber