Implement a Queue on a char [] array. Do not use ::Queue:: class from the STD library for this example. When you hardcode your queue look to make it work. Then update the code to make the queue circular. The user will input a string and the program will return the string with each letter in the string duplicated. Displaying correct Queue implementation. Utilize the conventional/traditional methods as needed. enqueue() / push_back() dequeue() / pop_front() Sample Execution Please input String: happy

Create a class called ResizingArrayQueueOfStrings that uses the queue abstraction using a fixed-size array. Then, as an extension, use array resizing in your implementation to get rid of the size restriction.

Please fix this The countOff() method displays the name of each officer removed from the queue, in the order in which they are removed, and displays the name of the officer that goes for help. For example, the output for the queue of defenders above with a count of 4 would appear as:Defenders leaving the queue are: Horace Alsbury, PVT, Kentucky, survivorSimon Arreola, —, —, survivorPeter James Bailey III, PVT, Kentucky, fatalityJohn J. Ballentine, PVT, Pennsylvania, fatalityRobert Allen, PVT, Virginia, fatalityMicajah Autry, PVT, North Carolina, fatalityWilliam Charles M. Baker, CPT, Missouri, fatalityJames L. Allen, PVT, Kentucky, survivorJesse B. Badgett, —, Texas, survivorRichard W. Ballentine, PVT, Scotland, fatalityJosé María Arocha, —, —, survivorJuan Abamillo, SGT, Texas, fatalityIsaac G. Baker, PVT, Arkansas, fatalityJuan A. Badillo, SGT, Texas, fatalityJohn Ballard, —, —, fatalityMiles DeForest Andross, PVT, Vermont, fatality The defender going for help is: George Andrews, —,…

Java language NOTE THAT WE ARE USING **LINKED LISTS** SEE PICTURES FOR ALL INFORMATION Solve method public boolean inSort(double elt) { //code goes here } please and thank you!!!!