1- A) Assume you have array of integers of size S. You want to organize it such that all negative numbers will be on the right of the array and the positive numbers on the left. Write a Java code that uses no more than two temporary Stacks to solve the problem.

NB: You do not need to write the code for Stacks, you are using a Stack from the library with a name MAC286Stack that exposes the following interface: MAC286Stack() constructor, pop, push, isEmpty, size(), peek()).

B) Can you think of a way to solve the problem by using only one single stack?