Just write functions as required in the pic

#include

using namespace std;

struct node

{

int info;

node *next;

};

class sll

{

private:

node *head;

public:

sll(){head=NULL;}

void AddNode (int);

void Traverse();

int sum();

};

void sll::AddNode (int val)

{

}

void sll::Traverse()

{

}

int sll::sum ()

{

}

int main()

{

sll s;

int inf, ch;

while(1)

{

cout

cin>>ch;

switch(ch)

{

case 1:

cout

cin>>inf;

s.AddNode(inf);

break;

case 2:cout

s.Traverse();

break;

case 3:

cout

break;

default: exit(0);

} // end of switch

} // end of while loop

return 0;

} // end

The following program stores a list of integer numbers dynamically through a singly linked list, complete it by defining the following functions: AddNode (int): Adds a new node at the beginning 1- of the list. 2- Traverse(): Prints the values stored in the list. 3- int sum(): Returns the sum of all information fields in the list. The following program stores a list of integer numbers dynamically through a singly linked list, complete it by defining the following functions: AddNode (int): Adds a new node at the beginning 1- of the list. 2- Traverse(): Prints the values stored in the list. 3- int sum(): Returns the sum of all information fields in the list