Write a method, remove, that takes three parameters: an array of integers, the length of the array, and an integer, say, removeItem. The method should find and delete the first occurrence of removeItem in the array. If the value does not exist or the array is empty, output an appropriate message. (Note that after deleting the element, the array size is reduced by
1) You may assume that the array is unsorted. Do NOT sort array.
2) re-do exercise, this time use a bubble sort to sort the array and then remove the item with the array sorted. Creat a method for the bubblesort.
3) re-do exercise, this time use an insertion sort as given in this chapter to sort the array and then remove the item with the array sorted. Create a method for the insertion sort.
4) Make sure your array with a small array of 5 interers and a larger array of at least 25 integers. When testing, test the removal of the first item in the array, somewhere in the middle and the last item in the array.