Consider an arbitrary character string of length N. Design an efficient algorithm that is ON) that determines whether or not the character string is in the form Yz, such that x and z are sequences of X's and Zs that are mirror images of each other (e.g., x = XZZXZ, z= ZXZZX) and Y is simply the letter Y. Implement the STL find routine that returns the iterator containing the first occurrence of X in the range that begins at start and extends up to, but not including end. If x is not found, end is returned. This is a nonclass (global function) with signature: template typename Iterator, typename objects Iterator find(Iterator start, Iterator end, const object& x)