A peak element of an array of n elements is an element at a position i such that a[i - 1] < a[i] and a[i + 1] < a[i] where 0 < i < size - 1. or the peak is the first element of an array, a[1] < a[0] or the peak is the last element of the array. a[size 2] < a[size [ 1] Write and test thoroughly a function that returns the number of peaks and the positions of the peaks in an array of n elements . The function's prototype is void peaks(int a[], int n, int p[], int &pcount); where a is an integer array, n is an integer, p is an integer array, and pcount is an integer.