C++ Implement the generic algorithm max_element(start, stop). Recall that this algorithm returns an iterator that points to the maximum element in the range [start,stop). If the range is empty, stop is returned. Elements are compared by using the < operator. The arguments start and stop are bidirectional iterators.

Write a C++ program that:   (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer, (using the STL implementations), storing strings, using the following hash function:   ((first_letter) + (last_letter) - (second_letter))% 15   (2) the driver program should:   a. query the user for ten words and store them using the hash technique described above.   b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled.   c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).

C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.

C++ Create a generic function increment(start, stop, x) that adds x to every element in the range [start,stop). The addition is done using the + operator. The arguments start and stop are bidirectional iterators. Write a test driver.