Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x modulo 2 (remainder is either 0 or 1) Assign x with x divided by 2 Note: The above algorithm outputs the 0's and 1's in reverse order. Ex: If the input is: 6 the output is: 011 6 in binary is 110; the algorithm outputs the bits in reverse. Use something like print(x % 2, end=''). After the loop is over terminate the print line with print().

Write a program with loops to solve each of the following (comment each block of code):   Compute the sum of all odd numbers between a and b (inclusive), where a and b are inputs. Prompt the user for a and b. Display the sum. Read a sequence of integer inputs and print the smallest and largest of the inputs. Prompt for a line of input as a string and display the string, with all vowels replaced by an underscore.

Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - ­1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ).  Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 :  n = 4 / 2  = 2Step 2 : n = 2 / 2  =  1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 :  n = 7 ­- 1 = 6Step 2 : n = 6  / 3 = 2 Step 3 : n = 2 / 2 = 1  SolutionDp///.

plz explain python

Write a program that takes in a line of text as input, and outputs that line of text in reverse. The program repeats, ending when the user enters "Done", "done", or "d" for the line of text. Ex: If the input is: Hello there Hey done then the output is: ereht olleH yeH 461710 3116371

Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. Ex: If the input is 6, the output is: 011 (6 in binary is 110; the algorithm outputs the bits in reverse).