The textbook question is below. This is my code (before the textbook question). I can't seem to get (e) to work. Can I have some help?

public void removeMid() {

int currentSize =values.length;

int pos = values.length/2;

if (!(values.length%2==0)){

for(int i = pos+1; i

values[i-1] = values[i];

}

currentSize--;

}

else

{

int pos2 =(values.length/2)-1;

for(int i = pos+1; i

values[i-1] = values[i];

for(int j = pos2+1; j

values[j-1] = values[j];

}

currentSize=currentSize-2;

}

}

}

This is the textbook question:

E7.10 Write array methods that carry out the following tasks for an array of integers by completing the Array Methods class below. For each method, provide a test program. public class ArrayMethods private int[J values public ArrayMethods (int[] initial Values) f values initial Values public void swap FirstAndLast public void shiftRight 1 a. Swap the first and last elements in the array. b. Shift all elements to the right by one and move the last element into the first position. For example, 1 4 9 16 25 would be transformed into 25 1 49 16. c. Replace all even elements with 0. d. Replace each element except the first and last by the larger of its two neighbors. e. Remove the middle element if the array length is odd, or the middle two elements if the length is even. f. Move all even elements to the front, otherwise preserving the order of the elements. g. Return the second-largest element in the array. h. Return true if the array is currently sorted in increasing order. i. Return true if the array contains two adjacent duplicate elements. j. Return true if the array contains duplicate elements (which need not be adjacent)