Given a data structure that is a list of tuples (see line below), write one line of code that accesses the first element of the 3rd tuple in the list. Assume this element exists. list_of_tups = [(4, 5), (6, 7, 8, 0), (9, 1, 2)] # add your line of code that produces the desired output of 9

Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){      a+=curNode->getItem();       curNode=curNode->getNext();       if(curNode!=NULL)            curNode=curNode->getNext(); } A.32 B.43 C.19 D.18

Consider the following function access_element_by_index that returns the iterator to the element at the index i in the list l.   typedef std::list<int> int_list; int_list::iterator access_element_by_index(size_t I, int_list &) {        assert( ? );        … }   Assume the first element of the list is at the index 0, the second at the index 1, and so on. If the function is required to return an iterator that can be dereferenced, determine the precondition of the function, and write an assertion to validate it. (You don’t need to implement the functions).

3. Write the remove_evens() function that receives a list of integers as a parameter and returns a new list of integers containing only the odd numbers from the original list. Ex1) If n = [1, 2, 3, 4, 5, 6], remove_evens(n) returns [1, 3, 5]. Ex2) If n = [2, 4, 8], remov move_evens(n) returns [].