See list_handout.pdf for the class definition and implementation of a double linked list. Rewrite the findnode(int index)functionto perform a forward search in the first half ofthe list if index

list_handout 09/08/17 09:57:11 #include #include using namespace std; Hint: Notice how the three different list implementations on the next several pages use the SAME public interface with the only differences being wrt the implementation details class 1ist/see next several pages Hint: Notice how the operator member functions are overloaded differently to support the different underlying 1ist types void printlist (const char operation, list &v) cout ./list list v v.push-back (7) s=1 : 7 v.push_back (8) s-2 7 8 push-back (9) s=3 : 7 8 9 v.insert (1,20) : 7 20 8 9 v.erase (2) v.insert (0,11) -4:11 7 20 9 push back (2) 5 11 7 20 9 2 pop back ) v.insert (1, 4) S-511 47 20 9 v[1] = 5 clear ( s=0 : s-37 20 9 s-4:11 7 20 9 s=5 : 11 5720 9 S=0<>