Problem $4$: Add the method below that reverses the elements in the queue. For example, if the queue contains the elements $24681012,$ then it will contain the elements $12108642$ after being reversed. public void reverseQueue$()\{$ Problem $5$: Add the method below that returns an array containing the elements that are in the stack, in the same order $($where the head element will be the first element in the array$).$ The array will be an Object array and should have the same size as the queue. The method must not make any changes to the queue. For example, if the queue contains $24681012,$ then this method will return the array $24681012$ public Object$[]$ toArray$()\{$