I WILL MARK BRAINLIEST PLZ HELP
Consider the following algorithm. What number should the algorithm return at step 9?

Step 1: Have the user input an integer -- call it $n$.

Step 2: Add 4 to n.

Step 3: Multiply the sum by 3.

Step 4: Add n to this product.

Step 5: Divide this sum by 2.

Step 6: Add 4 to this quotient.

Step 7: Divide this new sum by 2.

Step 8: Subtract n from this new quotient.

Step 9: Output this difference.

The more powerful, 60 volt cables and the main power shut-off on an hev are both colored orange.

The computers in the sales department did not have enough data storage capacity to contain all the information the department needed to store, and it was taking a long time for team members to access the data they needed. to fix the problem, the technician installed new, larger hard drives on all the computers.

Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.