c++ with output please

Lab (3) The following program stores a list of integer numbers dynamically through a singly linked list, complete it by defining the following functions: 1- AddNode (int): Adds a new node at the end of the list. 2- Traverse(): Prints the values stored in the list. 3- int count(int x) : Returns the number of nodes contain x. #include using namespace std; struct node { int info; node *next; }; class sll { private: node *head; public: sil({head=NULL;} void AddNode (int); void Traverse(); int count(int); }; void sll:: AddNode (int val) { node *newNode= new node; newNode->info=val; newNode->next=head; head=newNode; } void sll:: Traverse { } int sll::count (int x) {