data structers c++

Question S: In each of the following, highligh the only correct response. (6 marks) 1. To say that a program X has a better time complexity than a program Y means: (A) X will be a better choice for all inputs. (B) X will be a better choice for all inputs except perhaps small inputs. (C) X will be a better choice for all inputs except perhaps large inputs. (D) X will be a better choice except perhaps for small and large inputs. (E) X will be a better choice in some specific user-defined scenarios 2. Consider a linked-list based ADT, implemented as per the code fragment below. Suppose objp is a pointer to a Container object that has three nodes struct Node f class Container f string data; Nodenext; private: Node head; I/address of first node public: .. member functions The statement cout head->next->next->next->data instance, the statement cout