This QueueStackUtil class tests various usages of the Queue interface and Stack classes
param1 is an array of string. You will create a queue with each string as an element of
the queue. You will then reverse the order of the queue elements by removing each queue 
element and pushing it on a stack. You will then pop off each element and add it into the 
queue. The resukt will be a queue with its elements reversed.

Complete the following file:

QueueStackUtil.java

import java.util.LinkedList; import java.util.Queue; /** This QueueStackUtil class tests various usages of the Queue interface and Stack classes param1 is an array of string. You will create a queue with each string as an element of the queue. you will then remove each element which has more than 4 characters in it, leaving the queue with the remaining 3 or shorter strings in the original order */ public class QueueStackUtil { public static Queue<String> check(String[] values) { // TODO: create a queue, named queue // TODO: use a "for each" loop to add every array element into the queue processQueue(queue); return queue; } public static void processQueue(Queue<String> queue) { // remove all elements in the queue, adding back in those that // are length 3 or less } }