Create a CircularArray class that supports an array-like data structure that can be rotated efficiently. If at all possible, the class should use a generic type (also known as a template) and iterate using the standard for (Obj o: circularArray) notation.

In C++ /** * Performs an index-based bubble sort on any indexable container object. * * @tparam IndexedContainer must support `operator[]` and `size()`, e.g. * `std::vector`. Container * elements must support `operator<` and `operator=`. * * @param values the object to sort */ template <typename IndexedContainer> void bubble_sort(IndexedContainer &values){ //TODO }   /** * Sorts the elements in the range `[first,last)` into ascending order, using * the bubble-sort * algorithm. The elements are compared using `operator<`. * * @tparam Iterator a position iterator that supports the [standard * bidirectional iterator * operations](http://www.cplusplus.com/reference/iterator/BidirectionalIterator/) * * @param first the initial position in the sequence to be sorted * @param last one element past the final position in the sequence to be sorted */ template <typename Iterator> void bubble_sort(Iterator first, Iterator last) { //TODO }

Write a template function that takes as parameter a vector of a generic type and reverses the order of elements in the vector, and then add the function to the program you wrote for Programming Challenge 5. Modify the driver program to test the new function by reversing and outputting vectors whose element types are char, int, double, and string.

A) Consider the generic print() method, write a method that takes an array of E, where E must be Comparable or extend a type that is Comparable, and returns a reference to the greatest object in the array.  In this case, the greatest value is one for which compareTo() would return 0 or more for any other object in the array.  If there is more than one possible largest value (these would have to be equal to each other but greater than any other objects in the array), it does not matter which one you choose.  B) Write a generic Java queue class (a plain queue, not a priority queue).  Call it GenericQueue, because the JDK already has an interface called Queue.  The class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown in the lecture notes for some hints.  Like the Stack, the GenericQueue should use an underlying ArrayList<E>.  Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a…