In the space below, create an algorithm to print out all the values of the binary counter, for a length of $8$ bits,with a $2-$second pause in$-$between each print. Use pseudocode written in a style similar to the given algorithm,and implement it in Java. You may use as many additional pages as necessary for this purpose.

INCREMENT $(A)$

$i=0$

while $A[i]==1A[i]=0i=i+1A[i]=1Ai.$ length

$A[i]=1$

Note that $Aisan$ array $of$ symbols, $0$ and $1.i.$length and $A[i]==1$

$A[i]=0$

$i=i+1$

$ifi.$ length

$A[i]=1$

Note that $Aisan$ array $of$ symbols, $0$ and $1.$