Write an java algorithm that prints out all the subsets of three elements of a set of n elements. The elements of this set are stored in a list that is the input to the algorithm.

ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1​,N2,⋯​ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…

IN JAVA PLEASE, need help finding an element in the list     /**     * Returns whether the given value exists in the list.     * @param value - value to be searched.     * @return true if specified value is present in the list, false otherwise.     */     public int indexOf(int value) {        //Implement this method                return -1;    }

In Java