I dont understand how to code this using visual studio (Java).

Collatz conjecture Collatz Conjecture Consider the following algorithm to generate sequence of numbers. The algorithm stops when the sequence reaches 1 Start with any positive integer Xo Repeat the following until it reaches 1 o if x is even, then Xi+1 X/2 (half ..." if x is odd, then xi +1-3x; + 1(..or triple plus one") The resulting sequence will be: xo. x1, X2. ...X where xk-1; For example, the Collatz sequence for Xo = 7 is: 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2,1 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