(Java) Identify the true elements. Select all that apply: - Java arrays are mutable -Elements can be appended to an existing ArrayList instance -Arraylists cannot store primitive data types -Arrays can store primitive types and reference types -One ArrayList can store different types of objects

(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;}

(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());…