Please use C++ for question 5

1. (Weight: 2096) what does the following code fragment do? vector my_vector; my_vectorpush back(3.456) my_vector.push_back(5) double result my vectormy_vector(0] cout prev; a. node ptr->prev->next tail; tail->prev node_ptr->prev; b. DNode node_ptr-head head new DNode("Tamika") head->next node ptr node ptr->prev head DNode DNode DNode DNode DNode next s prev datas Tom next n prev a datas John" next prev datas "Harry" next preva datas "Sharon next a preva datas "Sam" 5. (Weight: 2596) PROGRAMMING-Using the single-linked list shown in the figure below, and assuming that head references the first Node and tail references the last Node, write statements to do each of the following. a. Insert "Bill" before "Tom" (You have a reference to the head (Tom). b. Insert "Sue" before "Sam" (You only have a reference to Sam and the head) c. Remove "Bill" d. Remove "Sam" (You only have a reference to the head and Sam) Node Node Node Node next- data "Tom next data "John" next = data "Harry" nexta datas"Sam