Use the implemented stack on the Lab manual $($using array$)$ to write a complete

C$++$ program that contain the following:

$$ A function to fill up stack with randomly characters $($from a$-$z and A$-$Z only$)4$pts

$$ A function to split this stack into two separated stacks; the first stack must only

contain the upper$-$case characters and the second stack must only contain the

lower$-$case characters. $4$pts

$$ main function to test the previous two functions and display the content of the

three stacks. $2$pt

Sample output:

Input stack : a $,$ A $,$ u $,$ P $,$ j $,$ e $,$ N $,$ I $,$ N

First stack : A $,$ P $,$ N $,$ I $,$ N

Second stack: a $,$ u $,$ e

Notes:

$$ Don$$t use #include or any other external libraries to solve the question $($

you can only use #include using name space std or

#include $)$

$$ The output must be exactly as mentioned.

mplemented stack on the Lab manual $($using array$)$ :

template

class Stack $\{$ int topindex;

T entry$[$MAX$]$; $//$ Maximum size of Stack

public:

Stack$()\{$ topindex $=0$; $\}$

bool Push$($T x$)$

$\{$

if $($topindex $>=$ MAX$)$

return false;

entry$[$topindex$++]=$ x;

return true;

$\}$

bool Pop$()$

$\{$

if $($topindex

return $0$;

topindex$--$;

return $1$;

$\}$

bool Top$($T &x$)$

$\{$

if $($topindex

return $0$;

x $=$ entry$[$topindex$-1]$;

return $1$;

$\}$

bool Empty$()$

$\{$

return $($topindex $==0)$;

$\}$

$\}$;

template

void print$($Stack s$)$

$\{$T item;

while $(!$s$.$Empty$())$

$\{$

s$.$Top$($item$)$;

cout$$

void fill$($Stack &s$,$ int n$)$

$\{$

for $($int i$=1$;in;i$++)$

s$.$Push$($rand$()\%100)$;

$\}$