It's a java question, thanks

Write the static method roll(Stack s, int n) that transforms the stack designated by s such that the n bottom elements are now on the top of the stack. The relative order of the top and bottom elements must remain unchanged. Stack O: s push ("a"); s push ("b"); s push ("c"); s push ("d"); s push "e"): System out printin (s): roll (s 2) System. out prin n (s) Executing the above Java test program displays the following: a, b, c, d, e c, d, e, a, b] Make sure to handle all exceptional situations appropriately. Since you do not know the size of the stack, cannot use arrays for temporary storage. Ins the you must use You can the existence of the class LinkedStack, which implements interface Stack. Stack is an interface. public interface Stack E boolean is Empty E peek E pop void push (E elem