Java Algorithm Programming Question Implement the ADT queue by using a circular linked list. Recall that this list has only an external reference to its last note.

Implement MSD string sorting using queues, as follows: Keep onequeue for each bin. On a first pass through the items to be sorted, insert each item intothe appropriate queue, according to its leading character value. Then, sort the sublistsand stitch together all the queues to make a sorted whole. Note that this method doesnot involve keeping the count[] arrays within the recursive method.

Q3 QuickSort Given the QuickSort implementation from class, provide an 18-element list that will take the least number of recursive calls of QuickSort to complete. As a counter-example, here is a list that will cause QuickSort to make the MOST number of recursive calls: public static List input() { return Accaxsaslist(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); } wwwwwww And here's the QuickSort algorithm, for convenience: algorithm QuickSart Input: lists of integers 1st of size N Output: new list with the elements of lat in sorted order if N < 2 return st pivot Jat[N-1] left = new empty list right = new empty list for index = 0, 1, 2, if lst[i]<= pivot left.add(lat[i]) = else N-2 right add(lat[i]) return QuickSort(left) + [pivot] + QuickSort (right)

The circular array queue implementation increased the dequeue operation's performance from O(n) to O(1) by doing away with the requirement to move array items. Adding or removing members from a list can occur anywhere along its length, not simply at the front or back, thus this is not true.

Write an java algorithm that prints out all the subsets of three elements of a set of n elements. Theelements of this set are stored in a list that is the input to the algorithm.