Please help using C++

Thank you.

Problem 1. Implement a sorted singly linked list and support the following operations: bool SortedisEmpty): return true if the list is empty; int SortedGetlength): return the length of the list; bool SortedFind(int k, int& x: return the value of the kth element: int SortedSearchlint key): return the position of the element which is same as key (note: use the most efficient method); void Sortedinsert(int x): insert x to the right position in the sorted linked list; void SortedDelete(int k, int&x,bool&success): delete the kth element. Part (1) Implement the aboved singly linked list allowing the duplicate element. Part (2) Implement the above singly linked list without allowing the duplicate element. Test your program for both parts with the following operations: a) Insert 5 b) Insert 7 c) Insert 9 d) Insert 11 e) Insert5 f Print out the list 8) Insert 7 h) Print out the list i) Find the 3rd element j) Search 7 k) Print out the length of the list l) Delete7 m) Print out the list n) Search7