Given the following code and assuming ArrayStackis a generic class: bool ArrayStack::doSomething() { bool result false ; if (!isEmpty()) { top--; result true ; } return result; } What method is this? pop() peek() virtual destructor default constructor

Program #11. Show the ArrayStackADT interface 2. Create the ArrayStackDataStrucClass<T> with the following methods: default constructor, overloaded constructor, copy constructor, initializeStack, isEmptyStack, isFullStack, push, peek, void pop 3. Create the PrimeFactorizationDemoClass: instantiate an ArrayStackDataStrucClass<Integer> object with 50 elements. Use a try-catch block in the main( ) using pushes/pops. 4. Exception classes: StackException, StackUnderflowException, StackOverflowException 5. Show the 4 outputs for the following: 3,960 1,234 222,222 13,780

implement  changeArrayLength(int m) – void method;   public class Course {    public String code;    public int capacity;    public SLinkedList<Student>[] studentTable;    public int size;    public SLinkedList<Student> waitlist;     public Course(String code) {        this.code = code;        this.studentTable = new SLinkedList[10];        this.size = 0;        this.waitlist = new SLinkedList<Student>();        this.capacity = 10;    }     public Course(String code, int capacity) {        this.code = code;        this.studentTable = new SLinkedList[capacity];        this.size = 0;        this.waitlist = new SLinkedList<>();        this.capacity = capacity;    }     public void changeArrayLength(int m) {        // insert your solution here    }   This method creates a new student table for this course; this new table has the given length m; the method moves all registered students to this table, as described in more detail below. Note that this method itself…