In Python please!and this is the previous hailstone sequence code I used:

Recall the hailstone sequence from an earlier assignment: the integer sequence that results from manipulating a positive integer value n as follows: . If n is even, divide it by 2 (using integer division) . If n is odd, multiply it by 3 and then add 1 Repeat this process until you reach 1. For example, starting with n-5, we get the sequence 5, 16, 8,4,2,1 If n 6, we get the sequence 6,3, 10,5, 16,8,4,2,1 of the hailstone sequence starting with n One possible recursive algorithm you can consider implementing is this