Part $2$:

In class, you were given the source code for building a queue data structure based on a linked list. You are given this source code $($assign$4\_$part$2.$cpp$)$ but it misses the implementation of the "vowelCheck" fuction. You are asked to provide the implementation of this function as described below.

The vowelCheck fucntion receives two queues and copies the elements from the first queue into the second queue when the element value is not vowel.

Hint: Vowel Letters are $\{A,O,$I,$E,U,a,o,i,e,u\}.$

$\backslash$table$[[\backslash$table$[[$Example of Input Queues to the function$],$

Import Notes:

You are NOT allowed to change the parameters given for the "oddCheck" and "vowelCheck" functions. #include

using namespace std;

struct Node $\{$

char data;

struct Node $*$next;

$\}$;

char peek$($Node $*$front$,$ Node $*$rear$)\{$ return front$->$data; $\}$

void enqueue$($Node $**$front$,$ Node $**$rear$,$ int data$)\{$

Node $*$newNode $=$ new Node;

newNode$->$data $=$ data;

newNode$->$next $=$ NULL;

if $(*$front $==$ NULL$)\{$

$*$front $=$ newNode;

$*$rear $=$ newNode;

$\}$ else $\{$

$(*$rear$)->$next $=$ newNode;

$*$rear $=$ newNode;

$\}$

$\}$

char dequeue$($Node $**$front$,$ Node $**$rear$)\{$

Node $*$temp $=*$front;

char x $=(*$front$)->$data; $//$ or int x $=$ temp $->$ data;

$*$front $=(*$front$)->$next;

if $(*$front $==$ NULL$)$

$*$rear $=$ NULL;

delete temp;

return x;

$\}$

void printQueue$($Node $*$front$,$ Node $*$rear$)\{$

if$($front $!=$ NULL$)\{$

Node $*$curr $=$ front;

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

cout $$ curr$->$data ;

curr $=$ curr$->$next;

$\}$

cout $$ curr$->$data ;

cout $$ endl;

$\}$

$\}$

void VowelCheck$($Node $*$front$1,$ Node $*$rear$1,$ Node $**$front$2,$ Node $**$rear$2)\{$

$\}$

int main$()\{$

Node $*$front$1=$ NULL;

Node $*$rear$1=$ NULL;

Node $*$front$2=$ NULL;

Node $*$rear$2=$ NULL;

enqueue$($&front$1,$ &rear$1,\text{'}$M$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$o$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$h$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$a$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$m$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$m$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$a$\text{'})$;

enqueue$($&front$1,$ &rear$1,\text{'}$d$\text{'})$;

printQueue$($front$1,$ rear$1)$;

VowelCheck$($front$1,$ rear$1,$ &front$2,$ &rear$2)$;

printQueue$($front$2,$ rear$2)$;

return $0$;

$\}$