Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively. Please make the solution at least as efficient as O(nlog2n).   public class Sort {  public void sortColors(int[] nums) {    // your code goes here  } }

JAVA programming language i need to create an "addFront" method in the bottom of the code that adds an element at the front. [-1, -3, -5]  A.add(-9) ===> [-9, -1, -3, -5]. Its all the way in the bottom, please help me. public class ourArray  { //define an array of integers private int[] Ar; //Ar is a reference  //declare  private int capacity = 100; private int size = 0; private int increment = 10;   //default constructor   public ourArray() { Ar = new int[100]; capacity = 100; size = 0; increment = 10;   } //Constructor that accepts the capacity (C). It creates an array of C integersm, sets capacity to C //  Increment to 10 public ourArray(int C) { Ar = new int [C]; size = 0; capacity = C; increment = 10; } //Constructor that accepts two integers (c, i) c for capacity and i for increment public ourArray (int C, int I) { Ar = new int[C]; size = 0; capacity = C; increment = I;   }   //setter for Increment public void setincrement(int I) { increment = I; } //getter for size, capacity…

Find first repeating element in an array of integers in python. Find the first repeating element in array of integers. For example : Input : array[] = {10, 7, 8, 1, 8, 7, 6} Output: 7 [7 is the first element actually repeats]

Given an array of numbers, and an integer, find the last index that    that integer appears in the array. If the number is not    found, return -1.   import java.util.ArrayList;public class LastIndexFound{public static int solution(ArrayList<Integer> nums, int numToFind){// ↓↓↓↓ your code goes here ↓↓↓↓return 0;}}