Using Java

You are given a Node class and a List class:

public class Node

{

int data;

Node next;

}

public class List

{

Node first;

}

You are also given a Stack class. The following functions are available for use:

public class Stack {

public boolean isEmpty(){};

public void push(int n){};

public int pop(){};}

Write a Java method snglyRevToStck that pushes the data found in a linked list t in reverse order into the stack s, such that the last data in the list will be pushed first into the stack s, and so on.

Hint: You may use a temporary stack to accomplish the task.

You are given a Node class and a List class: public class Node int data: Node next; public class List Node first; You are also given a Stack class. The following functions are available for use: public class Stack I public boolean isEmpty Opublic void push (int n) public int pop (O Write a Java method snglyRevToStck that pushes the data found in a linked list t in reverse order into the stack s, such that the last data in the list will be pushed first into the stacks, and so on. Hint: You may use a temporary stack to accomplish the task