In an implementation of a list class template std::list Which of the following statements would 1) add an element t of type T to the list? (3pts) A) push back(t): B) addFirst(t); D) reset(t): E) front(0, t); Retrieval of an arbitrary k'n element of type T from a std::vector T container is an operation that has complexity on the order of .. (3pts) B) O(no) D) O(log n) A) O(k) When looking for an generic element k in an std::set say mySet which is the correct API call (4pts) 3) A) mySet.push _back(k) C) mySet.popfront(k) B) mySet.search(k) D) mySet.find(k) Which of the following is not correct for std:array (5pts) 4) A) It must not be created with a fixed size C) It must be created with a fixed size B) Is indexed from 0 D) Will not manage size increase itself Which one of the following statements is false? (5pts) 5) A) Iterators are not available for use with every ADT or container class template in the C++ standard library B) An Iterator defined on a generic container class type A can be used to iterate over any C) An iterator if defined on a generic container class list can be advanced using the++ D) An iterator has special benefits when it comes to the runtime safety of not iterating past the other container type B-T*, where the template tvpe T is the same operator end of the container and causing a crash