Write a static method named vowelsBeforeconsonants that accepts an array of characters as a parameter and rearranges its elements so that all even vowels appear before the consonants. For example, if the following array is passed to your method: char[] numbers = {'r', 't', 'a', 'o', 'p', 'u'}; Then after the method has been called, one acceptable ordering of the elements would be: {'a', 'o', 'u', 'r', 't', 'p'} The exact order of the elements does not matter, so long as all vowels appear before all For example, the following would also be an acceptable ordering: consonants. {'o', 'a', 'u', 't', 'p', 'r'} Do not make any assumptions about the length of the array or the range of values it might contain. For example, the array might contain no even vowels or no consonants. You may assume that the array is not null. You may not use any temporary arrays to help you solve this problem. (But you may declare as many simple variables as you like, such as chars.) You also may not use any other data structures such as the ArrayList class from Chapter 10. DO NOT use Arrays.sort in your solution. Hint: This is actually a sorting problem. In BubbleSort you tested pairs of elements and swapped them if the left element is larger than the right element. In this problem, the swap happens when the left element is a vowel and the right element is a consonant.

A method named getUserStringsAndPopulate Array(). This method should keep prompting the user to enter as many strings as the user wants. The user should be able to stop entering strings by entering EXIT. This method should take the strings entered by the user and populate a one-dimensional array of strings with the user input. The string EXIT should NOT be added to the array because it is a special flag that will tell the method to stop prompting the user to enter more strings. This method should return the one-dimensional array of strings populated with user input and should not accept any arguments. 2.b) A method named searchArray() that would accept a one-dimensional array of strings and search the array for the string Winter. The search logic should NOT be case sensitive. If a match is found, this method should print the string in the array followed by a message like "  --- Found a match!". Otherwise, the method should not print anything. This method should NOT return anything.…

2. Write a method that takes a rectangular two-dimensional array of type int and returns a valu of type int. The method returns the number of rows with negative sum. A row has a negative s if the sum of all its elements is less than 0. public static int countNegativeSum(int[][] in) Taken array Result 1 -3 17 -5 -5 14 -5 -2 30 -19 -8 -8 1 1 3 -1 -4 78 8 -3 -5 -1 -1 3 -4