In Python

[20 pts) The Hailstone sequence of numbers can be generated from a starting positive integer n by: If n is even then the next n of the sequence = n/2 If n is odd then the next n of the sequence = (3 * n) + 1 Continue this process until n is 1. The (unproven) Collatz conjecture is that the hailstone sequence for any starting number always terminates. Write the function hailstone(num) that takes in an integer num and returns a list with the hailstone sequence starting at num. Example: hailstone(5) will return [5, 16, 8, 4, 2, 1] hailstone(6) will return [6, 3, 10, 5, 16, 8, 4, 2, 1]