Halllo who can help me .
Here they say that we need at least four assertions orexceptions
Given a natural number n>0n>0, the next element of thehailstone sequence is computed as follows:
n→{n/2 if n is even
3n+1 otherwise
It is conjectured that the sequence will always eventually reach1, regardless of which value for nn one starts with. Given astarting number, the following piece of Java code computes thenumber of steps required until the sequence does so:
public int hailstoneLength(int n) { return compute(n);}private int compute(int n) { if (n == 1) {
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured