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 beginning of the list.

2- Traverse(): Prints the values stored in the list.

3- int deleteSecondNode():Deletes the second node , then return the deleted value.

use C++ please

1 Font Paragraph KI Styles #include using namespace std; struct node { int info; I node *next; }; class sll { private: node *head; public: sul {head=NULL;} void AddNode (int); void Traverse(); int count(int); }; void sll:: AddNode (int val) { } void all:: Traverse() { } int sll::count (int x) rds English (US) Text Predictions: On erences Review View Help Editing 9 - A A BEVEE 3 ab x x Aav A. Ao Find Styles Shoe Replace Reuse Files Font Paragraph 5 Styles Editing Reuse Files } void sll:: Traverse() { I } int sill::count (int x) { } int main() { sill s; int inf, ch: while(1) { cout>ch; switch(ch) { case 1: cout>inf; $. AddNode(inf); break; case 2:cout>ch: switch(ch) { case 1: cout>inf; S. AddNode(inf); break; case 2:cout>inf; cout