last question : Don't be negative

and source Code : of don't be negative

Repeat the assignment "don't be so negative" except solve the problem using recursion. Specifically, create an array of 10 random integers between -10 and +10 then create a method say "findNegatives" that takes as input parameters the array, and possibly other parameters, then calls itself (direct recursion); method find Negatives( ...method parameters here...) ...some stopping criteria... find Negatives(...method parameters here...) Output: Array position #0 #1 Value 10 7 -3 (Negative!) #3 #4 -8 (Negative) #5 10 #7 mimi -7 (Negative!) Create a simple program that uses an ARRAY of integers. The program randomly generates 10 integers between the values of negative 10 and positive 10 and stores them in the array. Then the program loops through the array displaying what is stored in the array and "highlighting" those entries that are negative. Your output should look something like this: Code: public class Main public static void main(String[] args) int[] intArray = new int[10]; for(int i=0;i