Write a function, removeAll, that takes three parameters: an array of integers, the number of elements in the array, and an integer (say, removeItem). The function should find and delete all of the occurrences 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 number of elements in the array is reduced.) Assume that the array is unsorted.