public class Progression { // instance variable protected long current; /** Constructs a progression starting at zero. */ public Progression() { this(0); } /** Constructs a progression with given start value. */ public Progression(long start) { current = start; } /** Returns the next value of the progression. */ public long nextValue() { long answer = current; advance(); // this protected call is responsible for advancing the current value return answer; } /** Advances the current value to the next value of the progression. */ protected void advance() { current++; } /** Prints the next n values of the progression, separated by spaces. */ public void printProgression(int n) { System.out.print(nextValue()); // print first value without leading space for (int j=1; j  
 
 
Language: JAVA (eclipse)
 
with clear explanation please, thank you!
  Q1. Redesign the Progression class (covered in your theory book) to be abstract and generic, producing a sequence of values of generic type T, and supporting a single constructor that accepts an initial value. Note: Any subclass inherited from this class will remain as non-generic classes. Q2. Use a solution to Q1 to create a new progression class for which each value is the square root of the previous value, represented as a Double. You should include a default constructor that has 65,536 as the first value and a parametric constructor that starts with a specified number as the first value. Q3. Write a Java method that receives an ArrayList of generic type, and outputs how many times each element appears in the list. Test the method in the main by passing ArrayList of characters for one time, and passing another ArrayList of integers for the second time