java Implement a Stack class using a linked list, i) Insert at least 10 elements into the stack. ii) show push and pop operations on the stack. iii) Print the order of elements in the stack. iv) Print first and last elements of the stack.

Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. None of these choices allows for an efficient implementation of all methods.

suf: C nn.instru @ 2 S if the stack contains (from top) "5", "4", "3", "2", "1" and element = "new", the stack will contain "5", "4", "3", "new", "new" after interchange (). if the stack contains (from top) "5" and element "new", the stack will contain "new", "new" after interchange(). 30% Write public instanc method for MyStáck, called interchange (T element) to replac the bottom *two* items in the stack with element. wer than two items on the stack, upon return the stack should contain exactly two items that are element. Examples: F2 # ۲ 3 ۳ WE E ص X Assume class MyStack implements the following StackGen interface. For this question, make no assumptions about the implementation of MyStack except that the follo wing interface methods are implemented and work as documented. public interface StackGen { void push(T 0); // conventional stack behavior T pop(); // conventional stack behavior T top(); // returns, but does not remove, top element in stack boolean isEmpty(); // returns true…

54. What is the difference between the top and pop operations of a stack? Group of answer choices The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack and remove it.   The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack without removing it.   The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack without removing it.   The pop and top operations are doing the same thing which removes the top item of the stack.   The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack and remove it.

i want the solution for subpart 1

Recall the Stack ADT. It has the following operations: push(item): adds item to the top of the stack pop() : removes and returns the top item in the stack peek() : returns the top item in the stack (but does NOT remove it) size() : returns the number of items in the queue Write pseudocode for a function called remove(S, item) that takes a stack S and a value called item as input. The function removes all occurrences of item in S and returns the number of occurrences. The order of items in the modified stack must be the same as their original ordering (but with all occurrences of item absent). You can ONLY use basic control flow structures and Stack operations. You can use multiple stacks if you wish. Examples: S:= empty stack S.push('a'), S.push('t'), S.push('a'), S.push('u'), S.push('p') assert: the stack S now looks like ['a', 't', 'a', 'u', 'p'] (where 'p' is the top value) n = remove(S, 'a') assert : n is 2 assert : the stack S now looks like ['t', 'u', 'p'] (where 'p' is the top…

solution for subpart 3

Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…

java /* Practice Stacks and ourVector   Write a java program that creates a stack of integers.   Fill the stack with 30 random numbers between -300 and +300.   A)- With the help of one ourVector Object and an additional stack,   reorganize the numbers in the stack so that numbers smaller than    -100 go to the bottom of the stack, numbers between -100 and +100 in the middle   and numbers larger than +100 in the top (order does not matter)  B)- (a little harder) Solve the same problem using only one ourVector object for help  C)- (harder) Solve the same problem using only one additional stack as a helper   */   public class HWStacks {   public static void main(String[] args) { // TODO Auto-generated method stub   }   }

solution for subpart 4