Now suppose that we add weight to the truck in position 8 (which corresponds to the 9th entry of b) in increments of 0.001 tons until the bridge collapses. Each girder can withstand 20 tons of compression or tension (i. e., positive or negative forces) before breaking. This means that the bridge will collapse when the largest (in absolute value; i. e. max) force in x is larger than 20. Find the smallest weight of the truck at position 8 for which the bridge collapses and save this weight in a variable named A4. Find the index of the girder that breaks first and save it in a variable named A5.

Acommon algorithm for converting a decimal number to binary is to repeatedly divide the decimal number by 2 and save the remainder. this division is continued until the result is zero. then, each of the remainders that have been saved are used to construct the binary number.write a recursive java method that implements this algorithm.it will accept a value of int and return a string with the appropriate binary character representation of the decimal number.my code: public class lab16{public string converttobinary(int input){int a; if(input > 0){a = input % 2; return (converttobinary(input / 2) + "" +a); } return ""; } }