Revise the array list implementation given in Section 7.2.1 so that when the ac- tual number of elements, n, in the array goes below N/4, where N is the array capacity, the array shrinks to half its size.

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   }   }

Please help me with this Principles of programming language homework question

The language is Java. The method to use is provided!

Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }

c++