Please help using C++.

Thank you.

Implement the unsorted single linked list as we did in the class and implement the following operations: d list, if there are multiple copies (-2 copies). 2. DeleteSecondLastDuplicat0: For any element in the linked list, if there are multiple copies (2 1. DeletelastDuplicat): For any element in the linke delete the last copy copies), delete the second last copy Test your program with the following operations: a) Insert 5 b) Insert 7 c) Insert 11 d) Insert 5 e) Insert 7 f) Insert 5 g) Print out the list h) Delete the last duplicate of 5 i) Print out the list j) Delete the last duplicate of 11 k) Print out the list 1) Insert 11 m) Insert 7 n) Print out the list o) Delete the second last duplicate of 5 p) Print out the list q) Delete the second last duplicate of 7 r) Print out the list