Use the following code which adds and prints elements of a simply linked list, and add a
member function that will duplicate a list. Call your function properly in main and print the list
again. =inciude ciostreams using nanespace std: struct node 1 Int data: node "next; node(Int d,
node"nwe) \{ datand; nextwn; \} 3; class list publie: list() { headno; } vaid print() 1 for (node-"t-
head;t!-0;t-t->next) coutcct-2datact" ; coutckendl; 13 yold add (int e1) 1 hesdenea node (e1, bead
) ? 31 void maln() f. 11st iz 1. mdd(e) : 1. add (7) 1. add (1); 1. add () ) 1.add (1) z.
Use the following code which adds and prints elements of a simply lin.pdf
1. Use the following code which adds and prints elements of a simply linked list, and add a
member function that will duplicate a list. Call your function properly in main and print the list
again. =inciude ciostreams using nanespace std: struct node 1 Int data: node "next; node(Int d,
node"nwe) { datand; nextwn; } 3; class list publie: list() { headno; } vaid print() 1 for (node-"t-
head;t!-0;t-t->next) coutcct-2datact" ; coutckendl; 13 yold add (int e1) 1 hesdenea node (e1, bead
) ? 31 void maln() f. 11st iz 1. mdd(e) : 1. add (7) 1. add (1); 1. add () ) 1.add (1) z
