MLkGL SCk1

#include <iostream.h
int a50,;
void merge(int low,int mid,int high);
void merge_sort(int low,int high)
,
int mid;
if(low<high)
,
mid=(low+high)/2;
merge_sort(low,mid);
merge_sort(mid+1,high);
merge(low,mid,high);
,
,
void merge(int low,int mid,int high)
,
int h,i,j,b50,,k;
h=low;
i=low;
j=mid+1;

while((h<=mid)&&(j<=high))
,
if(ah,<=aj,)
,
bi,=ah,;
h++;
,
else
,
bi,=aj,;
j++;
,
i++;
,
if(hmid)
,
for(k=j;k<=high;k++)
,
bi,=ak,;
i++;
,
,
else
,
for(k=h;k<=mid;k++)
,
bi,=ak,;
i++;
,
,
for(k=low;k<=high;k++) ak,=bk,;
,
int main()
,
int num,i;

cout<<"MERGE SJRT PRJGRAM"<<endl;

cout<<endl;
cout<<endl<<endl;
cout<<"Please Enter THE NUMBER JF ELEMENTS you want to sort:"<<endl;
cinnum;
cout<<endl;
cout<<"Now, Please Enter the ( "<< num <<" ) numbers (ELEMENTS):"<<endl;
for(i=1;i<=num;i++)
,
cinai, ;
,
merge_sort(1,num);
cout<<endl;
cout<<"So, the sorted list (using MERGE SJRT) will be :"<<endl;

for(i=1;i<=num;i++)
cout<<ai,<<" ";
cout<<endl;

,

CU1U1
MERGE SJRT PRJGRAM



Please Enter THE NUMBER JF ELEMENTS you want to sort:
6
Now, Please Enter the ( 6 ) numbers (ELEMENTS):
5 32 1 24 76
So, the sorted list (using MERGE SJRT) will be :
1 5 24 32 76












LA SCk1

#include <iostream.h
const int MAX = 10 ;
class array
,
private :
int arrMAX, ;

int count ;
public :
array( ) ;
void add ( int num ) ;
void makeheap(int ) ;
void heapsort( ) ;

void display( ) ;
, ;
array :: array( )
,
count = 0 ;
for ( int i = 0 ; i < MAX ; i++ )
arrMAX, = 0 ;
,
void array :: add ( int num )

,
if ( count < MAX )
,
arrcount, = num ;
count++ ;
,
else
cout<< "\nArray is full" <<endl ;
,
void array :: makeheap(int c)
,

for ( int i = 1 ; i < c ; i++ )
,
int val = arri, ;

int s = i ;
int f = ( s - 1 ) / 2 ;
while ( s 0 && arrf, <val )

,
arrs, = arrf, ;
s = f ;
f = ( s - 1 ) / 2 ;

,
arrs, = val ;

,

,
void array :: heapsort( )
,
for ( int i = count - 1 ; i 0 ; i-- )
,
int ivalue = arri, ;

arri, = arr0, ;
arr0,=ivalue;
makeheap(i);

,

,
void array :: display( )
,
for ( int i = 0 ; i < count ; i++ )
cout<<arri, << "\t" ;
cout<<endl ;
,
int main( )

,
array a ;

a.add( 11 ) ;
a.add( 2 ) ;
a.add( 9 ) ;
a.add( 13 ) ;
a.add( 57 ) ;
a.add( 25 ) ;
a.add( 17 ) ;
a.add( 1 ) ;
a.add( 90 ) ;
a.add( 3 ) ;
a.makeheap(10) ;
cout<< "\nHeap Sort.\n" ;
cout<< "\nBefore Sorting:\n" ;
a.display( ) ;
a.heapsort( ) ;
cout<< "\nAfter Sorting:\n" ;
a.display( ) ;

,
OUTPUT:
Heap Sort.

Before Sorting:
90 57 25 13 11 9 17 1 2 3

After Sorting:
1 2 3 9 11 13 17 25 57 90
SLLLC1ICN SCk1

#lncludesLdloh
lnL maln()

lnL sl[Lempa20

prlnLf(LnLer LoLal elemenLs )
scanf(ds)

prlnLf(LnLer d elemenLs s)
for(l0lsl++)
scanf(dal)

for(l0lsl++)
for([l+1[s[++)
lf(ala[)
Lempal
ala[
a[Lemp



prlnLf(AfLer sorLlng ls )
for(l0lsl++)
prlnLf( dal)

uLpuL
LnLer LoLal elemenLs 3
LnLer 3 elemenLs 4 3 0 21 7
1he array afLer sorLlng ls 0 4 3 7 21


S1ACk USING AkkA
//Program Ior Stack implementation through Array
#include stdio.h~
//#include ctype.h~
#deIine MAXSIZE 5
int stack|MAXSIZE|;
int top0; //index pointing to the top oI stack
void main()

void push();
void pop();
void display();
int will1,i;
clrscr();
while(1)

printI("\n\n\nMAIN MENU:\n\n1.PUSH\n2.POP\n3.EXIT\n\nENTER YOUR CHOICE: ");
scanI("d",&will);
switch(will)

case 1:
push();
display();
break;
case 2:
pop();
display();
break;
case 3:
exit(0);
break;
deIault:
printI("Invalid Choice . ");
}


} //end oI outer while
} //end oI main


void push()

int num;
iI(top~MAXSIZE)

printI("\nSTACK FULL");
return;
}
else
iI(top0)
top0;
printI("\n\nENTER THE STACK ELEMENT : ");
scanI("d",&num);
stack|top|num;
}
}

void pop()

iI(top~0)
top--;

}

void display()

int i;
iI(top0)
printI("\n\nSTACK EMPTY");
else
Ior(itop-1;i~0;i--)

printI("\n\nd ",stack|i|);
iI(i(top-1))
printI("----~TOP");
}
}

&%!&%

MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 1
ENTER THE STACK ELEMENT : 10
10 ----~TOP
MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 1
ENTER THE STACK ELEMENT : 20
20 ----~TOP
10
MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 1
ENTER THE STACK ELEMENT : 30
STACK FULL
30 ----~TOP
20
10
MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 2
20 ----~TOP
10
MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 2
10 ----~TOP
MAIN MENU :
1.PUSH
2.POP
3.EXIT
ENTER YOUR CHOICE : 1
STACK EMPTY


UICk SCk1
#lnclude losLream
#lnclude conloh

uslng namespace sLd
#lnclude losLreamh
consL lnL MAx 10
class array

prlvaLe

lnL arrMAx
lnL counL
publlc

array( )
vold add ( lnL lLem )
lnL geLcounL( )
sLaLlc lnL spllL ( lnL * lnL lnL )
vold qulksorL ( lnL lower lnL upper )
vold dlsplay( )

array array( )

counL 0
for ( lnL l 0 l MAx l++ )
arrl 0

vold array add ( lnL lLem )

lf ( counL MAx )

arrcounL lLem
counL++

else
couL nArray ls full endl

lnL array geLcounL( )

reLurn counL

vold array qulksorL ( lnL lower lnL upper )

lf ( upper lower )

lnL l spllL ( arr lower upper )
qulksorL ( lower l 1 )
qulksorL ( l + 1 upper )


lnL array spllL ( lnL *a lnL lower lnL upper )

lnL l p q L

p lower + 1
q upper
l alower
whlle ( q p )

whlle ( ap l )
p++
whlle ( aq l )
q
lf ( q p )

L ap
ap aq
aq L


L alower
alower aq
aq L
reLurn q

vold array dlsplay( )

for ( lnL l 0 l counL l++ )
couL arrl
couL endl

lnL maln( )

array a
aadd ( 11 )
aadd ( 2 )
aadd ( 9 )
aadd ( 13 )
aadd ( 37 )
aadd ( 23 )
aadd ( 17 )
aadd ( 1 )
aadd ( 90 )
aadd ( 3 )
couL nCulk sorLn
couL nArray before sorLlng endl
adlsplay( )
lnL c ageLcounL( )
aqulksorL ( 0 c 1 )
couL nArray afLer qulck sorLlng endl
adlsplay( )
geLch ()




Culk sorL

Array before sorLlng
11 2 9 13 37 23 17 1 90 3

Array afLer qulck sorLlng
1 2 3 9 11 13 17 23 37 90

LINkLD S1ACk
#lncludesLdloh
#lncludemalloch

#deflne maxslze 10
vold push()
vold pop()
vold dlsplay()

sLrucL node


lnL lnfo
sLrucL node *llnk


node *sLarLnuLL
node *newnode*Lemp*p
Lypedef sLrucL node n

lnL maln()


lnL cha
do


prlnLf(LLLLlnked sLack)
prlnLf(n 1ush)
prlnLf(n 2op)
prlnLf(n 3ulsplay)
prlnLf(n 4LxlL)

prlnLf(n LnLer your cholce )
scanf(dch)

swlLch(ch)


case 1

push()
break

case 2

pop()
break

case 3

dlsplay()
break

case 4

exlL(0)

defaulL

prlnLf(nlnvalld cholce)
break




whlle(ch3)



vold push()



newnode(n*)malloc(slzeof(n))
prlnLf(nLnLer Lhe lLem )
scanf(dnewnodelnfo)
newnodellnknuLL
lf(sLarLnuLL)

sLarLnewnode

else


psLarL
whlle(pllnk!nuLL)
ppllnk
pllnknewnode





vold pop()


lf(sLarLnuLL)

prlnLf(nSLack ls empLy)

else lf(sLarLllnknuLL)


prlnLf(n1he deleLed elemenL ls dsLarLlnfo)
free(sLarL)
sLarLnuLL



else


psLarL
whlle(pllnk!nuLL)


Lempp
ppllnk



prlnLf(nueleLed elemenL ls dn plnfo)
LempllnknuLL
free(p)





vold dlsplay()


lf(sLarLnuLL)

prlnLf(nSLack ls empLy)

else


prlnLf(n1he elemenLs are )
psLarL
whlle(p!nuLL)


prlnLf(dplnfo)
ppllnk


prlnLf(n)





C




Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 1

Enter the item : 2
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 3

The elements are : 2
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 1

Enter the item : 3
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 3

The elements are : 23
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 2

Deleted element is : 3
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice : 3

The elements are : 2
Linked stack
1.Push
2.Pop
3.Display
4.Exit
Enter your choice :


LINkLD ULUL
#lncludesLdloh
#lncludemalloch
#deflne MAxSlZL 10

vold lnserLlon()
vold deleLlon()
vold dlsplay()

sLrucL node


lnL lnfo
sLrucL node *llnk

*newnode*Lemp*p*fronLnuLL*rearnuLL
Lypedef sLrucL node n

maln()


lnL ch

do

prlnLf(nLLLLlnked queue)
prlnLf(n 1lnserLlon)
prlnLf(n 2ueleLlon)
prlnLf(n 3ulsplay)
prlnLf(n 4LxlL)
prlnLf(n LnLer your cholce )
scanf(dch)

swlLch(ch)


case 1

lnserLlon()

break

case 2

deleLlon()
break

case 3

dlsplay()
break

defaulL

break



whlle(ch3)



vold lnserLlon()



lnL lLem
newnode(n*)malloc(slzeof(n))
prlnLf(nLnLer Lhe lLem )
scanf(dlLem)
newnodelnfolLem
newnodellnknuLL
lf(fronLnuLL)

fronLnewnode

else

rearllnknewnode

rearnewnode



vold deleLlon()


lf(fronLnuLL)

prlnLf(nCueue ls empLy)

else


pfronL
prlnLf(nueleLed elemenL ls dplnfo)
fronLfronLllnk
free(p)





vold dlsplay()


lf(fronLnuLL)

prlnLf(nCueue ls empLy)

else


prlnLf(n1he elemenLs are )
LempfronL
whlle(Lemp!nuLL)


prlnLf(dLemplnfo)
LempLempllnk







C





Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice : 1

Enter the item : 23

Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice : 1

Enter the item : 34

Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice : 3

The elements are : 2334
Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice : 2

Deleted element is : 23
Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice : 3

The elements are : 34
Linked queue
1.Insertion
2.Deletion
3.Display
4.Exit
Enter your choice :

II8CNACCI SLkILS USING kLCUkSICN
#lncludesLdloh
#lncludeconloh
lnL maln()

vold flb(lnLlnLlnL)
lnL labcnxy

prlnLf(enLer Lhe no of Lerms n )

scanf(dn)
x0
y1
prlnLf(d dxy)
flb(xy(n2))
geLch()


vold flb(lnL alnL blnL no)

lnL l0c
lf(l!no)

ca+b
l++
prlnLf( dc)
flb(bcno1)



CU1U1


enter the no of terms
7
0 1 1 2 3 5 8


8U88LL SCk1
#lncludesLdloh
#lncludeconloh
lnL maln()

lnL A20 n 1emp l [
prlnLf(enLer Lhe number of Lerms n)
scanf(dn)
prlnLf(enLer Lhe elemenLs of Lhe array n)
for(l0 ln l++)


scanf(nLLd Al)

for(l0 ln1 l++)
for([0 [nl[++)
lf(A[A[+1)

1emp A[
A[ A[+1
A[+1 1emp

prlnLf(1PL ASCLnulnC uL LlS1 lSn)
for(l0 ln l++)
prlnLf(nLLLdAl)
geLch()


CU1U1




enter the number of terms :
5
enter the elements of the array:
100
23
67
34
78
THE ASCENDING JRDER LIST IS:

23
34
67
78
100


INSLk1ICN SCk1
#lnclude csLdllb
#lnclude losLream
#lnclude conloh

uslng namespace sLd
#deflne LLLMLn1S 6

vold lnserLlon_sorL(lnL xlnL lengLh)

lnL keyl
for(lnL [1[lengLh[++)

keyx[
l[1
whlle(xlkey l0)

xl+1xl
l

xl+1key



lnL maln()

lnL ALLLMLn1S324613
lnL x

couLnn S1Lu LlS1endl
for(x0xLLLMLn1Sx++)

couLAxendl

lnserLlon_sorL(ALLLMLn1S)
couLendlS1Lu LlS1endl
for(x0xLLLMLn1Sx++)

couLAxendl

geLch ()





nn S1Lu LlS1
3
2
4
6
1
3

S1Lu LlS1
1
2
3
4
3
6




SUM CI n NUM8LkS
#lncludelosLreamh
#lncludeconloh
vold maln()


clrscr()
lnL lnsum0
couLPow many numbers?
clnn
for(l1ln++l)

sum+l
couLnSuM sumendl

geLch()


C
Pow many numbers? 6
SuM 21

8INAk SLAkC
#lncludesLdloh
lnL maln()

lnL a10lnmc0lumld

prlnLf(LnLer Lhe slze of an array )
scanf(dn)

prlnLf(LnLer Lhe elemenLs ln ascendlng order )
for(l0lnl++)
scanf(dal)


prlnLf(LnLer Lhe number Lo be search )
scanf(dm)

l0un1
whlle(lu)
mld(l+u)/2
lf(mamld)
c1
break

else lf(mamld)
umld1

else
lmld+1

lf(c0)
prlnLf(1he number ls noL found)
else
prlnLf(1he number ls found)

reLurn 0



Sample ouLpuL
LnLer Lhe slze of an array 3
LnLer Lhe elemenLs ln ascendlng order 4 7 8 11 21
LnLer Lhe number Lo be search 11
1he number ls found
LINLAk SLAkC
#lncludelosLreamh
#lncludeconloh
vold maln()
lnLarr30numslze[0
sLarL
clrscr()
couLLnLer Lhe slze of array(max 30)n
clnslze
lf(slze1slze30)
goLo sLarL
for(lnL l0lslzel++)

couLLnLer elemenL no l+1n
clnarrl

couLnLnLer Lhe elemenL Lo be searched ln Lhe arrayn
clnnum
for(l0lslzel++)

lf(arrlnum)

couLnLlemenL found ln poslLlon no l+1n
[1


lf([0)
couLLlemenL noL foundn


LnLer Lhe slze of array(max 30)
6
LnLer elemenL no 1
11
LnLer elemenL no 1
13
LnLer elemenL no 1
20
LnLer elemenL no 1
34
LnLer elemenL no 1
1
LnLer elemenL no 1
36
LnLer Lhe elemenL Lo be searched ln Lhe array
13
LlemenL found ln poslLlon no 2

ALINDkCML
#lncludesLdloh

#lncludesLrlngh

vold maln()



char a100 b100

prlnLf(LnLer Lhe sLrlng Lo check lf lL ls a pallndromen)

geLs(a)

sLrcpy(ba)

sLrrev(b)

lf(sLrcmp(ab) 0 )

prlnLf(nLnLered sLrlng ls a pallndromen)

else

prlnLf(nLnLered sLrlng ls noL a pallndromen)

reLurn 0



C
LnLer Lhe sLrlng Lo check lf lL ls a pallndrome
Madam
LnLered sLrlng ls a pallndrome


II8CNACCI SLkILS

#lncludesLdloh
#lncludeconloh
vold maln()

lnL labcn
clrscr()
prlnLf(enLer Lhe no of Lerms n )
scanf(dn)
l3
a1
b1
prlnLf(nllbonaccl serles )
prlnLf(d dab)
whlle(ln)

ca+b
prlnLf( dc)
ab
bc
l++

geLch()


C
enLer Lhe no of Lerms
6
llbonaccl serles
1 1 2 3 3 8

kIML NUM8Lk
#lncludesLdloh
#lncludeconloh
vold maln()

clrscr()
lnL num l flag0
prlnLf (enLer a number )
scanf (d num)
for (l2 lnum/2 l++)

lf (numl0)
flag1


lf (flag1)
prlnLf (nlL ls noL a prlme number)
else
prlnLf (nlL ls a prlme number)


geLch()



enLer a number 21
lL ls noL a prlme number


MA1kIk MUL1ILICA1ICN

#lnclude csLdllb
#lnclude losLream
#lnclude conloh

uslng namespace sLd
lnL maln()

lnL a1010b1010c1010l[kmnpq


prlnLf(LnLer 1he ows And Cloumns And f 1he llrsL MaLrlx)
scanf(d dmn)
prlnLf(nLnLer 1he ows And Cloumns And f 1he Second MaLrlx)
scanf(d dpq)

prlnLf(nLnLer LlemenLs f 1he llrsL MaLrlxn)
for(l0l ml++)

for([0[ n[++)
scanf(dal[)


prlnLf(nLnLer LlemenLs f 1he Second MaLrlxn)
for(l0l pl++)

for([0[ q[++)
scanf(dbl[)

prlnLf(1he llrsL MaLrlx lsn)
for(l0l ml++)

for([0[ n[++)
prlnLf( d al[) //prlnL Lhe flrsL maLrlx
prlnLf(n)

prlnLf(1he Second MaLrlx lsn)
for(l0l pl++) // prlnL Lhe second maLrlx

for([0[ q[++)
prlnLf( d bl[)
prlnLf(n)

lf(n!p)

prlnLf(AborLlng!!!!!!/nMulLlpllcaLlon f 1he Above MaLrlces noL osslble)
exlL(0)

else

for(l0l ml++)

for([0[ q[++)

cl[ 0
for(k0k nk++)

cl[ cl[ + alk * bk[



prlnLf(nMulLlpllcaLlon f 1he Above 1wo MaLrlces Arenn)
for(l0l ml++)

for([0[ q[++)

prlnLf( d cl[)

prlnLf(n)


geLch()





LnLer 1he ows And Cloumns And f 1he Second MaLrlx2 3

LnLer 1he ows And Cloumns And f 1he Second MaLrlx3 2

LnLer LlemenLs f 1he llrsL MaLrlx
2 3 4 3 6 7

LnLer LlemenLs f 1he Second MaLrlx
21 32 43 34 63 76
1he llrsL MaLrlx ls
2 3 4
3 6 7
1he Second MaLrlx ls
21 32
43 34
63 76

MulLlpllcaLlon f 1he Above 1wo MaLrlces Are

431 330
818 1016



ULUL USING AkkA

#deflne MAxSlZL 10

sLrucL sL

lnL fronLrear
lnL queueMAxSlZL


sLrucL sL s

lnL empLy(vold)
lnL full(vold)
vold add(vold)
vold deleLe(vold)
vold dlsplay(vold)

vold maln()

char ans
lnL ch
sfronL 0
srear 0

do

clrscr()
prlnLf(********Cueue rogram**********n)
prlnLf(1 Auun)
prlnLf(2 uLLL1Ln)
prlnLf(3 ulSLA?n)
prlnLf(4 Cul1n)
prlnLf(LnLer ?our Cholce )
scanf(dch)
swlLch(ch)

case 1
add()
break
case 2
deleLe()
break
case 3
dlsplay()
break
case 4
exlL(1)
break

defaulL
prlnLf(lnvALlu CPlCL!!!!!!!!!!!!!!!!n)
break

prlnLf(nWanL 1o Co 1o 1he Maln Menuy/n)
flushall()
ans geLch()

whlle(ans y ans ?)
prlnLf(nress Any key 1o ConLlnuen)
geLch()


lnL full(vold)

lf (srear MAxSlZL)
reLurn(1)
else
reLurn(0)

lnL empLy(vold)

lf (sfronL srear + 1)
reLurn(1)
else
reLurn(0)


vold add(vold)

char ch
lnL x
do

lf(full() 1)

prlnLf(nnCueue lulln)
break

else

srear srear + 1
prlnLf(nLnLer An LlemenL Lo 8e Added )
scanf(dx)
squeuesrear x
lf(srear 1) sfronL ++

prlnLf(nuo ?ou WanL Lo Add More LlemenLsy/n)
flushall()
ch geLch()

whlle(chy ch ?)


vold deleLe(vold)

char ch
do

lf(empLy() 1)

prlnLf(nnCueue LmpLyn)
break

else

prlnLf( d Pas 8een ueleLed!squeuesfronL)
sfronL sfronL +1

prlnLf(nWanL Lo ueleLe More yn)
flushall()
ch geLch()

whlle(chy ch ?)


vold dlsplay(vold)

lnL l
clrscr()
lf(empLy () 1)
prlnLf(nCueue LmpLy!!)
else

prlnLf(nulsplaylng Cueuen)
for(l sfronLl prlnLf(dnsqueuel)


/************ u1u1 ***************

**********Cueue rogram**********
1 Auu
2 uLLL1L
3 ulSLA?
4 Cul1
LnLer ?our Cholce 1

LnLer An LlemenL Lo 8e Added 1
uo ?ou WanL Lo Add More LlemenLsy/ny
LnLer An LlemenL Lo 8e Added 2
uo ?ou WanL Lo Add More LlemenLsy/ny
LnLer An LlemenL Lo 8e Added 3
uo ?ou WanL Lo Add More LlemenLsy/ny
LnLer An LlemenL Lo 8e Added 4
uo ?ou WanL Lo Add More LlemenLsy/ny
LnLer An LlemenL Lo 8e Added 3
uo ?ou WanL Lo Add More LlemenLsy/nn
WanL 1o Co 1o 1he Maln Menuyn y

**********Cueue rogram**********
1 Auu
2 uLLL1L
3 ulSLA?
4 Cul1
LnLer ?our Cholce 3

ulsplaylng Cueue
1
2
3
4
3
WanL 1o Co 1o 1he Maln Menuyn y

**********Cueue rogram**********
1 Auu
2 uLLL1L
3 ulSLA?
4 Cul1
LnLer ?our Cholce 2
1 Pas 8een ueleLed!!
uo ?ou WanL 1o ueleLe More?y/n n
WanL Lo Co 1o Maln Menuey/n y

**********Cueue rogram**********
1 Auu
2 uLLL1L
3 ulSLA?
4 Cul1
LnLer ?our Cholce 3

ulsplaylng Cueue
2
3
4
3
WanL 1o Co 1o 1he Maln Menuyn y

**********Cueue rogram**********
1 Auu
2 uLLL1L
3 ulSLA?
4 Cul1
LnLer ?our Cholce 4 */