True or False 34. T F The array classis a fixed-size container. 35. T F The vector class is a fixed-size container. 36. T F You use the operator to dereference an iterator 37. T F You can use the ++ operator to increment an iterator 38. T FA container's end() member function returns a n iterator pointing to the last element in the container. A container's rbegin() member function returns a reverse iterator pointin o the first element in a container You do not have to declare the size of a vector when you define it. A vector uses an array internally to store its elements. A map is a sequence container. You can store duplicate keys in a map container The multimap class's erase() member function erases only one element at a time. If you want to erase multiple elements that all have the same key, you will have to call the erase() member function multiple times. All the elements in a set must be unique. The elements in a set are sorted in ascending order If the same value appears more than once in the initialization list of a set definition, an exception will occur at runtime. The unordered_set container has better performance than the set container. If two iterators denote a range of elements that will be processed by an STL algorithm function, the element pointed to by the second iterator is not included in the range. 39. T F 40. T 41. T 42. T 43. T 44. T F F F F F 45. T 46. T 47. T F F F 48. T 49. T F F 50. T F You must sort a range of elements before searching it with the binary search () function 51. T F Any class that will be used to create function objects must overload operator[] member function