/** Method name: arrayCopyOfQueue 
    *   Parameters: a Queue parameter called q 
    *   Pre: q.size() > 0 
    *   Post: result has the same content as q where 
    *   lowest index to greatest of the result array 
    *   corresponds to rear-to-front of the stack. 
    *   (Note that q should remain unaltered by this method.) 
    *   @param input Queue
    *   @return reversed Queue
    */
    public Queue arrayCopyOfQueue(Queue q){
        Queue newQueue = new Queue();
        if (q.size() > 0){
            Object nextObject = null;
 
            // have to know methods of your Queue class for getting and setting elements.
        }
        
        return newQueue;
    }
 

    /** Method name: arrayCopyOfQueue 
    *   Parameters: a Queue parameter called q 
    *   Pre: q.size() > 0 
    *   Post: result has the same content as q where 
    *   lowest index to greatest of the result array 
    *   corresponds to rear-to-front of the stack. 
    *   (Note that q should remain unaltered by this method.) 
    *   @param input Queue
    *   @return reversed Queue
    */
    public Queue arrayCopyOfQueue(Queue q){
        Queue newQueue = new Queue();
        if (q.size() > 0){
            ArrayList list = new ArrayList();
            Object nextObject = null;
            while ((nextObject = q.front()) != null){
                list.add(nextObject())
            }
            for (int i = list.size() -1; i >= 0; i=i-1){
                newQueue.enqueue(list.get(i));
            }
        }        
        return newQueue;
    }