The first line displays the Hailstone Sequence starting from n up to 1, separated by a space.The second line displays "The length of the sequence is X." where X is the length of the generated sequence.

Help Justin by writing a program using a function to calculate the Hailstone sequence.For example: If the input number is 13, the calculations are as follows:13 (Odd): 3 * 13 + 1 = 4040 (Even): 40 / 2 = 2020 (Even): 20 / 2 = 1010 (Even): 10 / 2 = 55 (Odd): 3 * 5 + 1 = 1616 (Even): 16 / 2 = 88 (Even): 8 / 2 = 44 (Even): 4 / 2 = 22 (Even): 2 / 2 = 1Hence the sequence is 13 40 20 10 5 16 8 4 2 1 and the length of the sequence is 10. Note: This question helps in clearing technical coding tests for service-based companies.Input format :The input consists of a positive integer n, representing the starting number for the Hailstone Sequence.Output format :The first line displays the Hailstone Sequence starting from n up to 1, separated by a space.The second line displays "The length of the sequence is X." where X is the length of the generated sequence.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ n ≤ 300Sample test cases :Input 1 :13Output 1 :13 40 20 10 5 16 8 4 2 1 The length of the sequence is 10.Input 2 :300Output 2 :300 150 75 226 113 340 170 85 256 128 64 32 16 8 4 2 1 The length of the sequence is 17.Input 3 :2Output 3 :2 1 The length of the sequence is

Justin needs a program to generate and analyze the Hailstone Sequence for a specific positive number up to 1. Hailstone Sequences follow these rules: If a number is even, divide it by 2. If a number is odd, multiply it by 3 and add 1.Help Justin by writing a program using a function to calculate the Hailstone sequence.

ingle File Programming QuestionProblem StatementJustin needs a program to generate and analyze the Hailstone Sequence for a specific positive number up to 1. Hailstone Sequences follow these rules: If a number is even, divide it by 2. If a number is odd, multiply it by 3 and add 1.Help Justin by writing a program using a function to calculate the Hailstone sequence.For example: If the input number is 13, the calculations are as follows:13 (Odd): 3 * 13 + 1 = 4040 (Even): 40 / 2 = 2020 (Even): 20 / 2 = 1010 (Even): 10 / 2 = 55 (Odd): 3 * 5 + 1 = 1616 (Even): 16 / 2 = 88 (Even): 8 / 2 = 44 (Even): 4 / 2 = 22 (Even): 2 / 2 = 1Hence the sequence is 13 40 20 10 5 16 8 4 2 1 and the length of the sequence is 10. Note: This question helps in clearing technical coding tests for service-based companies.Input format :The input consists of a positive integer n, representing the starting number for the Hailstone Sequence.Output format :The first line displays the Hailstone Sequence starting from n up to 1, separated by a space.The second line displays "The length of the sequence is X." where X is the length of the generated sequence.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ n ≤ 300Sample test cases :Input 1 :13Output 1 :13 40 20 10 5 16 8 4 2 1 The length of the sequence is 10.Input 2 :300Output 2 :300 150 75 226 113 340 170 85 256 128 64 32 16 8 4 2 1 The length of the sequence is 17.Input 3 :2Output 3 :2 1 The length of the sequence is 2.Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.Marks : 10Negative Marks : 0

Input format :The input consists of three space-separated integers values A, B, and C, representing the first term 'A' of the arithmetic sequence, 'B' to check, and the common difference 'C' of the arithmetic sequence.Output format :The output displays 1 if 'B' is present in the arithmetic sequence, otherwise, it displays 0.

Input format :The input consists of a single integer, n.Output format :The output displays the sum of consecutive numbers from 1 to n (exclusive), doubling each number before adding.