Note: you should bring the solution by hand to the office, using hand writing on $A4$ pages.

Use the following code for tracing the contents of the linked list implementation, Note draw the contents

step by step as we declared in the lecture.

a$.$ Please insert the following character values $\{p,a,1,a,c,e\},$ and then insert them in reverse order $e-p.$

Notice the resulting word

b$.$ And then draw a new graph for the following characters $\{r,e,f,e,r,r,a,1\}$

Inserting at the beginning of a linked chain

Hint: see the following figure

in c$++$

can i get a graph or drawn figure showing the code drawn for this

#include

using namespace std;

$//$ Definition of the Node struct

template

struct Node $\{$

ItemType item; $//$ A data item

Node$*$ next; $//$ Pointer to next node

$\}$;

$//$ Definition of the LinkedBag class

template

class LinkedBag $\{$

private:

Node$*$ headPtr; $//$ Pointer to the first node

int itemCount; $//$ Current count of list items

public:

$//$ Default constructor

LinkedBag$()$ : headPtr$($nullptr$),$ itemCount$(0)\{\}$

$//$ Member function to add a new node at the beginning of the list

bool add$($const ItemType& newEntry$)\{$

Node$*$ newNodePtr $=$ new Node$()$;

newNodePtr$->$item $=$ newEntry;

newNodePtr$->$next $=$ headPtr; $//$ New node points to chain

headPtr $=$ newNodePtr; $//$ New node is now first node

itemCount$++$;

return true;

$\}$

$//$ Member function to display items from the linked list

void display$()$ const $\{$

Node$*$ currentPtr $=$ headPtr;

while $($currentPtr $!=$ nullptr$)\{$

cout $$ currentPtr$->$item ;

currentPtr $=$ currentPtr$->$next;

$\}$

cout $$ "nullptr

$"$;

$\}$

$//$ Destructor to clear the linked list

~LinkedBag$()\{$

clear$()$;

$\}$

$//$ Member function to clear the linked list

void clear$()\{$

Node$*$ nodeToDeletePtr $=$ headPtr;

while $($headPtr $!=$ nullptr$)\{$

headPtr $=$ headPtr$->$next;

delete nodeToDeletePtr;

nodeToDeletePtr $=$ headPtr;

$\}$

itemCount $=0$;

$\}$

$\}$;

int main$()\{$

$//$ Example of using LinkedBag with char data type

LinkedBag bag;

bag.add$(\text{'}$p$\text{'})$;

bag.add$(\text{'}$a$\text{'})$;

bag.add$(\text{'}$l$\text{'})$;

bag.add$(\text{'}$a$\text{'})$;

bag.add$(\text{'}$c$\text{'})$;

bag.add$(\text{'}$e$\text{'})$;

cout $$ "Linked list after adding characters: $"$;

bag.display$()$; $//$ Displaying the linked list

return $0$;

$\}$

i need it drawn based on the questions

like the image i have provided for the words palace $,$ ecalap and referral