Define a function named hailstone that takes a positive integer parameter as the initial number of a hailstone sequence and returns how many steps it takes to reach $1($technically you could keep going $1,4,2,1,4,2,$ etc. but you will stop when you first reach $1).$ If the starting integer is $1,$ the return value should be $0,$ since it takes no steps to reach $1($we$\text{'}$re already there$).$ For example, if the starting integer is $3,$ then the sequence would go: $3,10,5,16,8,4,2,1$ and the return value should be $7,$ since it took $7$ steps to reach $1.$ Your function does not need to print anything out $-$ just return a value.