Pointers and Arrays

Main problem:
Calculate the sum of the even
numbers in the one-dimensional
array located between the minimum
and maximum values. The number
of elements in the array is n. Array
is the input data to the algorithms.
Input: n, Array
Output: Sum
Tasks:
1) A user enters size of array: n (integer, positive).
2) Declare an one-dimensional dynamic array of
positive integers of size n.
3) Implement filling the array by the user.
4) Display array values to the screen.
5) Calculate the sum of the even numbers in the
one-dimensional array located between the
minimum and maximum values (use the
developed algorithm in the first task).
6) Display the calculated sum to the screen.