Write a method `showHailstone`

that takes an integer parameter n and that displays the hailstone sequence starting at n and ending with 1. In a hailstone sequence, each value x is followed either by:

3x + 1 if x is odd

x/2 if x is even

The method calls below:

showHailstone(3);
showHailstone(10);
showHailstone(1);

should produce this output:

sequence for 3: 3, 10, 5, 16, 8, 4, 2, 1
sequence for 10: 10, 5, 16, 8, 4, 2, 1
sequence for 1: 1

It is believed that for any positive integer n, the sequence always reaches 1, although nobody has yet proven that this is true. Assume that your method is passed a number greater than 0.