11. Write a method that accepts a Queue of String as its parameter, this method separates the even length string from the odd length string (even length Strings on the left side and odd length String on the right side. You can use java’s Queue class. Remember that you can only take elements from the beginning of Queue and you can add element to the end of the Queue. You can only use one extra Stack storage. Solutions using more that one stack will get zero points. Remember that Queue is an interface in java meaning that you can declare a Queue but you need to instantiate as a LinkList. (refer to the provided lectures) Here is the output: Queue my = new LinkedList ();
my. add("hello");
my. add("Doctor");
my. add("for");
my. add("after");
my. add("");
my. add("");
my. add("never");
my. add("fully");
System. out. println(my);
seperate(my);
System. out. println(my);
public static void seperate(Queue names)
{
Stack even = new Stack();
int index = 0;
while(index < names. size())
{
String s = names. remove();//removes the elemnt at the begining of the list
//names. remove(0);
if(s. length() % 2 == 0)
even. push(s);
else
names. add(s);
index++;
}
while(!even. isEmpty())
{
names. add((String)even. pop());
}

}
}

Content of the Queue before the method call:
[hello, Doctor, for, after, , , never, fully]
Content of the Queue after the method call
[never, fully, hello, for, after, , , Doctor]