(JAVA) Write the code to create the following ragged array, given the following table. 3 5 7 9 4 2     5 7 8 6 6

(Java) Q3 explain the answers to the below questions using step-by-step explanation.   Fill in the missing line of code for the insert method for an array: public static void insert(String array[], int numElements, int indexToInsert, String newValue) {if (array.length == numElements) {System.out.println("Array is full. No room to insert.");return;}for (int i = numElements; i > indexToInsert; i--) {//fill in the missing line of code here}array[indexToInsert] = newValue;}

(Java) choose the correct multiple choice

(Intro to Java)  Explain the answers to the below questions. include a written answer to the question using step-by-step explanation   3. Write 5-6 lines of code to open a PrintWriter and write out the contents of the plants array into a text file named plants.txt

(Intro to Java)

(JAVA) Data Structures - Implementing a Queue using a Circular Array I've added the QueueOverflowException class, but I'm having trouble with the ArrayQueue Class. If you can do so, can you please add comments to every class and method in just the ArrayQueue class.   ****THIS IS THE CLASS THAT NEEDS ADDITIONAL CODE.***** public class ArrayQueue implements QueueInterface{    public static final int MAX = 10;     private T elements[];    private int front;    private int rear;     public ArrayQueue()    {        //awkward syntax!        elements = (T[]) new Object[MAX];        front = MAX - 1;        rear = MAX - 1;    }     //implement your methods here please} ***THE FOLLOWING CLASSES ARE GIVEN AND NEEDED TO COMPLETE THE PROGRAM**** public class Tester{    public static void main()    {        QueueInterface q = new ArrayQueue();         for (Character ch = 'A'; ch < 'F'; ++ch)            q.insert(ch);         while (!q.isEmpty())            System.out.println(q.remove());…

(Q9) This is a Data Structures problem and the programming language used is Lisp. Solve the question we detailed steps and make it concise and easy to understand. Please and thank you.