in Java

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 O'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 The program must define and call the following two methods. Define a method named intToReverseBinary 0 that takes an int as a parameter and returns a string of 1 's and 0 s representing the integer in binary (in reverse). Define a method named stringReverseO that takes a string as a parameter and returns a string representing the input string in reverse. public static string intToReversebinary (int integervalue) public static String stringReverse(String inputstring)