Consider the following implementation of strlen, which returns the length of a zero-terminated string: strlen:
li $v0, 0
top:
lbu $t0, 0($a0)
beqz $t0, ret
addiu $v0, $v0, 1
addiu $a0, $a0, 1
b top
ret:
jr $ra
(a) If strlen is called on a 10-character string, how many dynamic instructions will be executed? Explain your answer.
(b) Below, rewrite the function to reduce the total number of instructions executed (e. g., for a 10-character string). The bigger the reduction, the better.
(c) How many instructions will your solution for (b) execute for a 10-character string? Explain your answer.

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 ""; } }