JAVA programming I have to finish the "remove" method which is supposed to remove element e at index ind and returns it.  Ill paste the entire code below, but i only have to complete the "remove" method.   CODE: package com.mac286.arrays;   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) { //create an array of C integers 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) { //create an array of C integers Ar = new int[C]; size = 0; Capacity = C; Increment = I; }   //setter for Increment public void setIncrement(int I) { Increment = I; }   //getter for size, capacity and increment.  public int getSize() { return size; } public int getCapacity() { return Capacity; } public int getIncrement() { return Increment; }   //- A method void add(int e); it adds e to the end of the array.  // A.add(-1); A.add(-5), A.add(-9) [-1, -5, -9] public void add(int e) { //add only if there is space  if(size >= Capacity) { System.out.println("The array is full"); //get out  System.exit(1); } //if you are here it is not full Ar[size] = e; size++;   } //isEmpty returns true if it is empty and false it it is not.  public boolean isEmpty() { return (size == 0); } public String toString() { if(this.isEmpty()) return "[]"; String st = "["; //build your string [-1, -3, -9] for(int i = 0; i < size-1; i++) { //in the loop your are always dealing with element i //v element i is Ar[i] //append Ar[i], to the string st += Ar[i] + ", "; } //close the bracket  st += Ar[size-1] + "]"; return st; }   public void addFront(int e) { //check there is space  if (size >= this.Capacity) { System.out.println("Array is full"); System.exit(1); } //bring all values up by one  for(int i = size; i > 0; i--){ Ar[i] = Ar[i-1]; } //add e to index 0 Ar[0] = e; size++; } //remove removes the last item and returns it public int remove() { if(this.isEmpty()) { System.out.println("Error: the array is empty"); return -1; } int save = Ar[size-1]; //save the last element to be returned  //delete by just reduing the size  size--; //return the removed item return save;   } //removeFront() removes the first item and returns it //removeFront() removes the first item and returns it public int removeFront() { if(this.isEmpty()) { System.out.println("Error: the array is empty"); return -1; } int save = Ar[0]; //bring the rest down by one (size-1)( element down) for(int i = 0; i < size-1; i++) { Ar[i] = Ar[i+1];//if youy use size instead of size-1 you may get  //outofbounds exception } size--; return save; } //This method will add element e at index ind public void add(int ind, int e) { if (size >= this.Capacity) { System.out.println("Array is full"); System.exit(1); } if(ind == 0) this.addFront(e); else if (ind == size) this.add(e); else if(ind < 0 || ind > size) { System.out.println("Error: cannot add at those indices"); return; } //bring all values up by one  for(int i = size; i > ind; i--){ Ar[i] = Ar[i-1]; } //add e to index 0 Ar[ind] = e; size++;   } //int remove(intind) removes element e at index ind and returns it.  public int remove(int ind) { return 0;    }   }

JAVA programming

I have to finish the "remove" method which is supposed to remove element e at index ind and returns it. 

Ill paste the entire code below, but i only have to complete the "remove" method.

CODE:

package com.mac286.arrays;

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) {

//create an array of C integers

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) {

//create an array of C integers

Ar = new int[C];

size = 0;

Capacity = C;

Increment = I;

}

//setter for Increment

public void setIncrement(int I) {

Increment = I;

}

//getter for size, capacity and increment. 

public int getSize() {

return size;

}

public int getCapacity() {

return Capacity;

}

public int getIncrement() {

return Increment;

}

//- A method void add(int e); it adds e to the end of the array. 

// A.add(-1); A.add(-5), A.add(-9) [-1, -5, -9]

public void add(int e) {

//add only if there is space 

if(size >= Capacity) {

System.out.println("The array is full");

//get out 

System.exit(1);

}

//if you are here it is not full

Ar[size] = e;

size++;

}

//isEmpty returns true if it is empty and false it it is not. 

public boolean isEmpty() {

return (size == 0);

}

public String toString() {

if(this.isEmpty())

return "[]";

String st = "[";

//build your string [-1, -3, -9]

for(int i = 0; i < size-1; i++) {

//in the loop your are always dealing with element i

//v element i is Ar[i]

//append Ar[i], to the string

st += Ar[i] + ", ";

}

//close the bracket 

st += Ar[size-1] + "]";

return st;

}

public void addFront(int e) {

//check there is space 

if (size >= this.Capacity) {

System.out.println("Array is full");

System.exit(1);

}

//bring all values up by one 

for(int i = size; i > 0; i--){

Ar[i] = Ar[i-1];

}

//add e to index 0

Ar[0] = e;

size++;

}

//remove removes the last item and returns it

public int remove() {

if(this.isEmpty()) {

System.out.println("Error: the array is empty");

return -1;

}

int save = Ar[size-1]; //save the last element to be returned 

//delete by just reduing the size 

size--;

//return the removed item

return save;

}

//removeFront() removes the first item and returns it

//removeFront() removes the first item and returns it

public int removeFront() {

if(this.isEmpty()) {

System.out.println("Error: the array is empty");

return -1;

}

int save = Ar[0];

//bring the rest down by one (size-1)( element down)

for(int i = 0; i < size-1; i++) {

Ar[i] = Ar[i+1];//if youy use size instead of size-1 you may get 

//outofbounds exception

}

size--;

return save;

}

//This method will add element e at index ind

public void add(int ind, int e) {

if (size >= this.Capacity) {

System.out.println("Array is full");

System.exit(1);

}

if(ind == 0)

this.addFront(e);

else if (ind == size)

this.add(e);

else if(ind < 0 || ind > size) {

System.out.println("Error: cannot add at those indices");

return;

}

//bring all values up by one 

for(int i = size; i > ind; i--){

Ar[i] = Ar[i-1];

}

//add e to index 0

Ar[ind] = e;

size++;

}

//int remove(intind) removes element e at index ind and returns it. 

public int remove(int ind) {

return 0; 

}

}