2. your Net ID (e.g. jsmith) 3. your saceny Brook lD # (e.g., 111999999) 4. the course number (CSE 101) 5, the assignment name and number (Lab#7) Submit your final 1ab7. py file to Blackhoard by the due date and time. Late work will not be graded. Code that crashes and cannot be graded will earn no credit Part I: Recursive Hailstone Sequence (20 points) Recall the hallstone 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) e If n is odd, multiply it by 3 and then add I Repeat this process until you reach 1. For example, starting with n #Awe get the sequence 5, 16.8.421. If n 6. we get the sequence 6.3, 10,5, 16,8, 4,2, 1 Complete the function rec,hailstone.length (n), which recursively computes and then returms the length of the hailstone sequence starting with n. One possible recursive algorithm you can consider implementing is this CSE 101 Spring 2018 Lab #7 Page 1 Lt n 1 then return 1 othezwise stn is even return 1 + the next hakkatone value secording to the "even' tormula else return 1 t the next hailatone value according so the Todd" formula Note: Nos-recursive solutions to the probles that use loops will not earn creda Examples: urn Part II: Recursive Work Order Calculator (20 points)