Write a Java program that: i) Implements stack ADT.-

import java.io.*;

interface stack

{

void push(int item);

int pop();

}

class stackimpl

{

private int stck[];

private int top;

stackimpl(int size)

{

stck=new int[size];

top=-1;

}

void push(int item)

{

if(top==stck.length-1)

         System.out.println("stack is full insertion is not possible");

else

{

stck[++top]=item;

System.out.println("number is inserted");

}

}

int pop( )

{

if(top==-1)

{

System.out.println("stack is empty deletion is not possible");

return 0;

}

else

      return stck[top--];

            }

}

class stackdemo

{

public static void main(String args[])throws IOException

{

int a[];

InputStreamReader obj=new InputStreamReader(System.in);

BufferedReader br=new BufferedReader(obj);

System.out.println("Enter size of Stack ");

int n=Integer.parseInt(br.readLine());

stackimpl obj1=new stackimpl(n);

a=new int[n];

System.out.println("Enter elements into Stack");

for(int i=0;i

     a[i]=Integer.parseInt(br.readLine());

for(int i=0;i

     obj1.push(a[i]);

System.out.println("Stack contents are as follows");

for(int i=0;i

     System.out.println(" "+obj1.pop());

}

}