Suppose we have a Java class named IntArraystack which uses an array to implement a Stack that holds integers. (a) Write a new method void count PosNeg (IntArrayStack intArrayStackobj) to count and display the number of positive integers and number of negative integers in object intArrayStackobj. In addition, the intArrayStackobj object must be restored to its original state after counting.
(b) Describe the worst-case time complexity of the countPosneg method in Big-Oh notation.
(c) Write a RECURSIVE (NOT iterative) method Boolean sameStack(IntArrayStack stacki, IntArrayStack stack2) to check whether the two stack objects stack1 and stack2 contain the same elements (element order does MATTER). The sameStack method return true if the two input stacks contain the same elements and false otherwise. Note: You can ONLY call push, pop, and peek methods to perform operations on IntArrayStack object. Use o (1) as complexities for push, pop, and peek methods of Stack operations when performing analysis.