Additional directions : place in appropriate header and source files

Exercises in this collection revolve around algorithm usage with the C++ standard library and, especially, usage patterns for the Standard Template Library (STL). Exercise 6.1 Fill an array v of type std: : vector and into a std: :hash multiset<. output the first six elements of each container to console. use algorithms std: : copy>, std: : advanceo, and std: :ostream-iterator. Hint: also see the notes at the end of the exercise collection. [20pt] Exercise 6.2 Compare the three console outputs from exercise 6.1. Consult the C++ standard library reference at https://en.cppreference.com/ w/cpp with respect to the container concepts std: :map and std: :hash_map<. explain the differences between those container concepts and application-specific advantages disadvantages. exercises in this collection revolve around algorithm usage with c standard library especially patterns for template exercise fill an array v of type std: : vector size random numbers rand copy content into a :multiset> and into a std: :hash multiset<. output the first six elements of each container to console. use algorithms std: : copy>, std: : advanceo, and std: :ostream-iterator. Hint: also see the notes at the end of the exercise collection. [20pt] Exercise 6.2 Compare the three console outputs from exercise 6.1. Consult the C++ standard library reference at https://en.cppreference.com/ w/cpp with respect to the container concepts std: :map and std: :hash_map<. explain the differences between those container concepts and application-specific advantages disadvantages.>