Need to implement to pseudocode into the program provided.

Any help would be appreciated

dip search problem inputr a vector V of n integers output: the position of the last dip in V, or None if V does not contain a dip Hexe a dip is a sequence of three contiguous elements -2 whexe ,2 and Y12 For example, the sequence 5, 2, 5 is a dip. The integers axe not required to be positive, so -4, -6,-4 is also a dip. Note that the problem definition asks for the last-occurring dip. So if V contains multiple dips, a correct algorithm must return the later one (i.e. t the one at the higher index), The following algonithm solves the dip search problem dip_search(V): last_dip None for i from 0 through 3: If V[i]-V [i +2] and V [i+1] :: const-iterator find, dip(const std:.vectorints& values) { E IITODO: Rewrite the body of this function so that it actually works. That // includes rewriting the return statement. After you do that, delete this // comment. return values.end(); #include #include vector) #include "tiner.hpp" #include "balance. hPp void print bar() { std::cout