12. Add the following methods to the ArrayBoundedQueue class, and create a test driver for each to show that they work correctly. In order to practice your array coding skills, code each of these methods by accessing the internal variables of the ArrayBoundedQueue, not by calling the previously defined public methods of the class. String toString () creates and returns a string that correctly represents the current queue. Such a method could prove useful for testing and debugging the class and for testing and debugging applications that use the class. Assume each queued element already provides its own reasonable toString method. int the queue. void remove (int count) removes the front count elements from the queue, and throws QueueUnderflowException if there are less than count elements in the queue. boolean swapStart() returns false if there are less than two elements in the queue; otherwise it reverses the order of the front two elements in the queue and returns true. boolean swapEnds () returns false if there are less than two elements in the queue; otherwise it swaps the first and last elements of the queue and returns true. a. b. space ()returns an integer indicating how many empty spaces remain in c. d. e. 12. Add the following methods to the ArrayBoundedQueue class, and create a test driver for each to show that they work correctly. In order to practice your array coding skills, code each of these methods by accessing the internal variables of the ArrayBoundedQueue, not by calling the previously defined public methods of the class. String toString () creates and returns a string that correctly represents the current queue. Such a method could prove useful for testing and debugging the class and for testing and debugging applications that use the class. Assume each queued element already provides its own reasonable toString method. int the queue. void remove (int count) removes the front count elements from the queue, and throws QueueUnderflowException if there are less than count elements in the queue. boolean swapStart() returns false if there are less than two elements in the queue; otherwise it reverses the order of the front two elements in the queue and returns true. boolean swapEnds () returns false if there are less than two elements in the queue; otherwise it swaps the first and last elements of the queue and returns true. a. b. space ()returns an integer indicating how many empty spaces remain in c. d. e