Answered Essay: Please Do it in java!!!!!

public class Stack {

private int[] item;
private int top1,top2;
private int size;

public Stack(int max){
size=max;
item=new int[size];
top1=-1;
top2=size;

}

public void push1(int data){
if(top2-top1>1)
item[++top1]=data;
else
System.out.println(“No space to fill data on stack1 “);
}
public void push2(int data){
if(top2-top1>1)
item[–top2]=data;
else
System.out.println(“No space to fill data on stack2 “);

}
public int pop1(){
if(top1>-1)
return item[top1–];
else {
System.out.println(“underflow stack1”);
return 0;
}
}
public int pop2(){
if(top2<item.length)
return item[top2++];
else{
System.out.println(“underflow stack2”);
return 0;
}
}

/**
* to remove all items from the Stack.
*/
public void clear1()
{
for(int i = 0; i <= top1; i++)
item[i] = -1;

top1 = -1;
System.out.println(“Clearing stack 1”);

}
public void clear2()
{
for(int i = size; i <= top2; i–)
item[i] = -1;

top2 = size;
System.out.println(“Clearing stack 2”);

}

//check whether stack is empty

public void isEmpty1(){
if (top1==-1)
System.out.println(“Stack 1 Is empty”);
else
System.out.println(“Stack 1 Is not empty”);
}
public void isEmpty2(){
if(top2==(item.length))
System.out.println(“Stack 2 Is empty”);
else
System.out.println(“Stack 2 Is not empty”);
}

//check whether stack is full.

public void isFull(){
if(top1==size-1)
System.out.println(“array is full”);
else
System.out.println(“array is not full”);

}

public static void main(String[] args) {

Stack twostack=new Stack(10);
twostack.push1(9);
twostack.push2(8);
twostack.push1(99);
twostack.push2(98);
System.out.println(“Poped element from the 1st stack: “+twostack.pop1());
System.out.println(“Poped element from the 2nd stack: “+twostack.pop2());
twostack.isFull();
twostack.isEmpty1();
twostack.clear1();
twostack.isEmpty1();
twostack.isEmpty2();
twostack.clear2();
twostack.isEmpty2();

}

}

Output: