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. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 Your program must define and call the following two functions. The function integer_to_reverse_binary() should return a string of 1's and 0's representing the integer in binary (in reverse). The function reverse_string() should return a string representing the input string in reverse. def integer_to_reverse_binary(integer_v alue) def reverse_string(input_string) python

def integer_to_reverse_binary(integer_value):

   reverse_binary = ""

   while integer_value > 0:

       reverse_binary += str(integer_value % 2)

       integer_value = integer_value // 2

   return reverse_binary

def reverse_string(input_string):

   return input_string[::-1]

r = integer_to_reverse_binary(6)

print(reverse_string(r))

Explanation:

Create a function named integer_to_reverse_binary that takes one parameter, integer_value. Inside the function, initialize an empty string called reverse_binary to hold the result. Create a while loop that iterates while integer_value is greater than 0. Inside the loop, use the modulo operator to get the 0's and 1's and concatenate them to the reverse_binary. Use floor division to update the value of integer_value. After the loop, return the reverse_binary.

Create another function named reverse_string that takes one parameter, input_string. Inside the function, return the reverse of the input_string using slicing.

Call the functions to see the result

o an

answer; defense;