a-Assume you have a stack of integers. You want to organize it such that all numbers that are smaller than -100 go to the bottom, numbers between -100 and +100 in the middle and numbers larger than 100 in the top. Write a Java code that uses no more than three additional 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 SStack that exposes the following interface: SStack() constructor, pop, push, isEmpty, size(), peek()). 2- Solve the same problem as above using one stack and one queue (or two queues), with interface: SQueue() constructor, insert, remove, isEmpty, size()

b-Can you solve the problem using one list with an interface (insertFront, insertBack, removeFront, removeBack, isEmpty, size(), and insertAt(int index, int num) that inserts at specific index)