I need the java code for this

The Collatz Conjecture says that every such sequence will eventually reach 1. It has still not been proven until today but we already know for sure that this is true for every XO ? 258. For an input x, the cycle-length of x is the number of numbers generated up to and including the 1. In the example above, the cycle-length of 7 is 17 (i.e. length of the generated sequence including 1) In this problem, you are given two integer inputs i andj (i can be equal or greater than j) and your task is to compute and print the maximum cycle length over all numbers between i and j (inclusuive) Example First number: 1 Second number: 10 Maximum cycle between 1 and 10 is 20. First number: 200 Second number: 100 Maximum cycle between 100 and 200 is 125