List MakeEmpty(){
List new=(List)malloc(sizeof(struct LNode));new->Last =-1;returnnew;}
Position Find(List L, ElementType X){
int ret=ERROR;
int i;for(i =0; i <=L->Last; i++){if(X==L->Data[i]){
ret = i;break;}}return ret;}
bool Insert(List L, ElementType X, Position P){
int i;
bool ret =false;if(L->Last ==MAXSIZE-1){printf("FULL");}else{if(P<0||P>L->Last+1){printf("ILLEGAL POSITION");}else{for(i =L->Last; i >=P; i--){L->Data[i +1]=L->Data[i];}L->Data[P]=X;L->Last++;
ret =true;}}return ret;}
bool Delete(List L, Position P){
bool ret =false;
int i;if(P<0||P>L->Last){printf("POSITION %d EMPTY",P);}else{for(i =P; i <=L->Last -1; i++){L->Data[i]=L->Data[i +1];}
ret =true;L->Last--;}return ret;}