Using JAVA, write a method that modifies an ArrayList, moving all strings starting with an uppercase letter to the front, without otherwise changing the order of the elements. Write a test program to demonstrate the correct operation of the method.

The input to this method is supposedly an ArrayList of integers    that ranges from 1 to 100, however this is not exactly the case.    Sometimes, there will be gaps in the range for example, the range    could be: [1 2 ... 7 8 ... 99 100], with missing ranges in between.    Find all the missing numbers from the range, add them to an ArrayList,    return the ArrayList.------------------------ Below is my code that is failing. It is returning the correct missing numbers but is not going passed the last number  from the array. so [4,5,14,16,23,76,89] It is placing all of the missing numbers up to 88 when it should be going to 100 The solution should only return the missing numbers from 1-100. The original numbers from the given array should not be included in the return. How can I only return the missing numbers?  ------------------------ public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> result = new ArrayList<Integer>();int count =…

Execute the following statements over initially empty ArrayList myList one after another (cascade). Explain what was changed after each statement (what did it do?) myList.add("z"); ArrayList content: Your explanation (where this output came from): myList.add(0, "a"); ArrayList content: Your explanation (where this output came from): myList.add("t"); ArrayList content: Your explanation (where this output came from): myList.add(2,"w"); ArrayList content: Your explanation (where this output came from): myList.set(0,"b"); ArrayList content: Your explanation (where this output came from):

Hi, I am not sure what's wrong with my code. Can you please check why it is giving me an error?   In the starter file is a partial implementation of a doubly-linked list in DoublyLinkedList.java. We will write three new methods in this class to provide additional functionality. Write a method addFirst that adds a new element at the beginning of a DoublyLinkedList. Write a method addLast that adds a new element at the end of a DoublyLinkedList. Write a method removeFirst that removes and returns the first element of a DoublyLinkedList. Try to keep your implementations as simple as possible. For example, recall this definition of addFirst in the (Singly) LinkedList class: public void addFirst(E value) { head = new Node(value, head); } In the DoublyLinkedList class, you will need to keep the three instance variables head, tail, and count updated in all methods. Note that addFirst and addLast will be symmetric to each other, as will removeFirst and removeLast (provided in the…