Exercise 5-6 Every Third Element Write a method that takes an integer queue q as an argument, and returns a queue containing (in reverse) every third element of q starting with the last element. For example, if q contains (a, b, c, d, e then a queue containing {e, b) should be returned. Note: for simpli- city reasons, the queue in this example is a queue of characters. if q contains (a, b, c, d, e, f, g, h, i, j) then a queue containing (j, g, d, a) should be returned. Only use queues and stacks! 27