I) The pointer variable first points to the first node of a linked list. The declaration of the node is given below. struct Node { Before: q Write C++ code to insert a new node q in the front of the linked list shown below. After insertion the node pointed to by q becomes the first node of the linked list. first After: }; first int data; Node* next;

17. The following function takes a parameter that is a list of integers; the list has at least one element. It is supposed to find the integer that is the largest and find the position of that integer in the list. The function has two incorrect lines of code that make the function compute the results incorrectly. Several lines are highlighted (bold, underlined) which COULD be incorrect. In the following questions, choose the correct line of code that should be in the function. 1 def findlarge(intlist): 2 largest = 0 3 pos = 0 for i in range(1,len(intlist)): if largest > intlist[i: 4 5 largest = intlist[i] pos = i return (largest, pos) 8 Select one of the following to correct a line of code in the function. a. Line 2 should be: largest = -1 b. Line 2 should be: largest = intlist[0] c. Line 4 should be: for i in range(0,len(intlist): %3D d. Line 4 should be: for i in range(1,len(intlist)-1): e. Line 8 should be: return largest 18. Select one of the following to correct a line of code in…

C++ The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the destructor to List. ~ List () {      for (int i = 0; i <size (); i ++)       {             pop_back ();          } } What problems does the destructor have? Select one or more options: 1. There are no parameters for the destructor. 2. The return value from pop_back (if any) is nerver handled. 3. The destructor will create a stack overflow. 4. The destructor will create dangling pointers. 5.The destructor will create memory leaks. 6.The destructor will create undefined behavior (equivalent to zero pointer exception). 7.The condition must be: i <size () - 1 8. There is at least one problem with the destructor, but none of the above.

C++ Splitlists( listType& list1, listType& list2，ItemType item) Function: Divides list into two lists according to the key of item. Precondition: list has been initialized and is not empty. Postconditions: list1 contains all the items of list whose keys are less than or equal to item key. List2 contains all the items of list whose keys are greater than items key. driver (.cpp) file in which you declare two objects of class Unsorted List one of which containsintegers into info part and the other one contains characters into info part. Both objects should not haveless than 20 nodes. a. Implement splitLists as a member function of the Unsorted List ADT. #include<iostream>#ifndef UNSORT_H#define UNSORT_Htemplate <class ItemType>struct NodeType{   ItemType info;   NodeType* next;};template <class ItemType>class UnsortedType{public:   UnsortedType();   ~UnsortedType();   bool full() const;   int lengthIs() const;   void makeEmpty();   void retrieveItem(ItemType&…