Answer the following statements true (T) or false (F)

1) Use the set_intersection algorithm to find the elements from a first set of sorted values
that are not in a second set of sorted values (both sets of values must be in ascending
order).
2) Algorithms lower_bound, upper_bound and equal_range are often used to locate insertion
points in sorted sequences.
3) Lambda expressions can also be used where function pointers and function objects are
used in algorithms.
4) Keywords typename and class as used with a template type parameter specifically mean
“any user-defined class type.”
5) A function template can be overloaded by another function template with the same
function name.

1. False. This algorithm is used to find the elements from the first set of sorted values
that are in the second set of sorted values.
2. True.
3. True.
State which of the following are true and which are false. If false, explain why.
4. False. Keywords typename and class in this context also allow for a type parameter
of a fundamental type.
5. True.