Math the STL algorithm with what it does! These examples use an STL container named 'v std::for_each(v.begin(), v.end(), (int& i) {i++; }); std::sort(v.begin(), v.end(); std::is_sorted(v.begin(), v.end() A. returns an iterator to the first item in the container for which the function returns false, else returns the .end() iterator if they all return true. B. reverses the order of the items in a sequential container. C. looks for elements matching the passed in value, moving all to the end of the container. Returns an iterator to the first of these matched elements. D. returns true if the functions returns true for ALL items in the container E. returns the number of times the element is found in the container F. returns a std::pair with the minimum and maximum values in the container. G.returns true if the container is sorted, else false H. returns true if the function returns false for ALL items in the container 1. fills specified range of the container with the value passed in. J. returns an iterator to the first element matching the passed in value, else the .end() iterator. K. Sorts the container L. Increments every item in the container. std::minmax_element(v.begin(), v.end() std:: find_if_not(points.begin(), points.end(), [](Vector2D point) {return point.x > 0 && point.y > 0; }); std::all_of(v.begin(), v.end(), [](int i) {return i