given the implementation of a singly $($linear$)$ linked list of character elements Please modify the code as follows. Add a function named "swapLastWithFirst" which swaps the first node with the last node. Thereafter, the "main" function should call "swapLastWithFirst" and then call "printList"

#include

using namespace std;

struct Node

$\{$

char data;

struct Node $*$next;

$\}$;

struct Node $*$head$=$NULL;

void printList$()$

$\{$

Node$*$ curr $=$ head;

while$($curr $!=$ NULL$)\{$

cout $<<$ curr$->$data $<<""$;

curr $=$ curr$->$next;

$\}$

cout $<<$ endl;

$\}$

void insertFirst$($char data$)\{$

Node$*$ newNode $=$ new Node;

newNode$->$data $=$ data;

newNode$->$next $=$ NULL;

if$($head $==$ NULL$)\{$

head $=$ newNode;

$\}$

else $\{$

newNode$->$next $=$ head;

head $=$ newNode;

$\}$

$\}$

void insertLast$($char data$)\{$

Node$*$ newNode $=$ new Node;

newNode$->$data $=$ data;

newNode$->$next $=$ NULL;

if$($head $==$ NULL$)\{$

head $=$ newNode;

$\}$

else $\{$

Node$*$ curr $=$ head;

while$($curr$->$next $!=$ NULL$)$

curr $=$ curr$->$next;

curr$->$next $=$ newNode;

$\}$

$\}$

void insertAtPos$($char data, int pos$)\{$

Node$*$ newNode $=$ new Node;

newNode$->$data $=$ data;

newNode$->$next $=$ NULL;

int curPos $=1$;

if$($head $==$ NULL$)\{$

head $=$ newNode;

$\}$

else $\{$

Node $*$curr $=$ head;

Node $*$prev;

while$($curPos $!=$ pos && curr$->$next $!=$ NULL$)\{$

prev$=$curr;

curr $=$ curr$->$next;

curPos$++$;

$\}$

prev$->$next $=$ newNode;

newNode$->$next $=$ curr;

$\}$

$\}$

void deleteAtPos$($int pos$)\{$

Node$*$ curr $=$ head;

int curPos $=1$;

if $($head $!=$NULL$)$

$\{$

if$($pos $==1)\{$

head $=$ curr$->$next;

delete curr;

$\}$

else$\{$

Node $*$prev;

while$($curPos $!=$ pos && curr$->$next $!=$ NULL$)\{$

prev$=$curr;

curr $=$ curr$->$next;

curPos$++$;

$\}$

prev$->$next $=$ curr$->$next;

delete curr;

$\}$

$\}$

$\}$

int search$($char value$)$

$\{$

int pos $=1$;

Node$*$ curr $=$ head;

while$($curr $!=$ NULL$)\{$

if$($curr$->$data $==$ value$)$

return pos;

pos$++$;

curr $=$ curr$->$next;

$\}$

return $-1$;

$\}$

int main$()\{$

cout $<<$ "Hello World!

$"$;

insertFirst$(\text{'}$a$\text{'})$;

insertFirst$(\text{'}$b$\text{'})$;

insertFirst$(\text{'}$c$\text{'})$;

insertFirst$(\text{'}$d$\text{'})$;

printList$()$;

insertLast$(\text{'}$e$\text{'})$;

insertLast$(\text{'}$f$\text{'})$;

insertAtPos$(\text{'}$g$\text{'},3)$;

printList$()$;

deleteAtPos$(3)$;

printList$()$;

deleteAtPos$(1)$;

printList$()$;

int pos $=$ search$(\text{'}$e$\text{'})$;

cout $<<$ pos $<<$ endl;

pos $=$ search$(\text{'}$f$\text{'})$;

cout $<<$ pos $<<$ endl;

return $0$;

$\}$