Implement a class Stack that manages an array list of elements of type E. Provide methods push, pop, and isEmpty. (Java) Lab

Implementation of largest-cover difference #23@title Implementation of largest-cover difference def rectangle_difference(r, t): "Computes the rectangle difference rt, and outputs the result as a list of rectangles." assert len(r) == len(t), "Rectangles have different dimensions" ### YOUR SOLUTION HERE In the above code, we notice how it paid off to encapsulate intervals in their own abstraction. Now that we need to reason about rectangles, we do not need to get bogged down into complicated considerations of how to perform difference; the comparisons between endpoints are all done in the context of intervals, where it is easier to reason about them. It is often the case that problems become easy, once you think at them in the appropriate context. It is much easier to develop the code for the difference of intervals, as we have done, and then move on to difference of rectangles, rather than trying to write code for rectangle difference directly. The result is also far more elegant. # Let…

Implement a simple linked list in Python (Write source code and show output) with basic linked list operations like: (a) create a sequence of nodes and construct a linear linked list. (b) insert a new node in the linked list. (b) delete a particular node in the linked list. (c) modify the linear linked list into a circular linked list. Use this template: class Node:def __init__(self, val=None):self.val = valself.next = Noneclass LinkedList:"""TODO: Remove the "pass" statements and implement each methodAdd any methods if necessaryDON'T use a builtin list to keep all your nodes."""def __init__(self):self.head = None # The head of your list, don't change its name. It shouldbe "None" when the list is empty.def append(self, num): # append num to the tail of the listpassdef insert(self, index, num): # insert num into the given indexpassdef delete(self, index): # remove the node at the given index and return the deleted value as an integerpassdef circularize(self): # Make your list circular.…

Im trying to figure out a java homework assignment where I have to evaluate postfix expressions using stacks and Stringtokenizer as well as a isNumber method. when I try to run it it gives me an error. this is the code I have so far:   static double evaluatePostfixExpression(String expression){     // Write your code       Stack aStack = new Stack();       double value1, value2;     String token;     StringTokenizer tokenizer = new StringTokenizer(expression);     while (tokenizer.hasMoreTokens()) {       token = tokenizer.nextToken();       if(isNumber(expression)) {         value1 = (double)aStack.pop();         value2 = (double)aStack.pop();         if (token.equals("+")) {           aStack.push(value2+value1);         } else if (token.equals("-")) {           aStack.push(value2-value1);         } else if (token.equals("*")) {           aStack.push(value2*value1);         } else if (token.equals("/")) {           aStack.push(value2/value1);         }       }           }…