$1.$ Binary Manipulation

ALL

Given an integer, store its binary representation bin as a string or an array with digits indexed from Oto length$($bin$)-1.$ Reduce its binary representation to zero by using the following operations:

$1$

$1.$ Change the binary digit only if $(+1/$th binary digit is $1$ and all other binary digits from $(1+2)$ to the end are zeros.

$2$

long mi

$2.$ Change the rightmost digit without restriction.

$3$

What is the minimum number of operations required to complete this task?