PLEASE CODE THIS FUNCTION IN C++ THANK YOU SO MUCH

/** * Returns an iterator to the first element in the range [first,last) that * compares equal to val. If no such element is found, the function returns * last. The function uses operator== to compare the individual elements to val. * The position iterators must support the standard input iterator operations: * http://www.cplusplus.com/reference/iterator/InputIterator/ * * @param first the initial position in the sequence to be sorted * @param last one element past the final position in the sequence to be sorted * @param val the value for which to search * @return An iterator to the first element in the range that compares equal to * val. If no elements match, the function returns last. */ template Iterator LinearSearch(Iterator first, Iterator last, const Value &val)