Peak (18 pts) You are given an array A with n elements and the following properties: 1. Either it...

Peak (18 pts) You are given an array A with n elements and the following properties: 1. Either it is sorted or 2. There exists an index k such that the array is sorted from 0 to k and sorted in reverse from k to n-1. In other words, there exists O<k<n-1 such that for all i<j<k and i>j>k we have A[i] <=A[j]<A[k] Below is the sequential implementation int peak(std::vector<int>& v, int start, ir for(int i=1;i<v.size()-1; if(v[i]>v[i-1]&& return -1; } Replace the above with a divide and conquer implementation. Write your implementations in the skeleton file peak/peak.h. The file peak/peak.cpp is for your convenience it will not be used by autograding.