File name: prob$4.$asm $(25$ points$)$ Given a one$-$byte number named $A,$ count the number of $1\text{'}$s in the binary representation of the number $A.$ For instance, if $A$ is $11110000$ b$,$ there are four $1\text{'}$s in A $($in the four most significant bits$).$ The number of $1\text{'}$s must be stored in a byte named C$.$ You must use a loop to solve this problem. Hint: In the first repetition of the loop, you can AND the number A with $00000001b$ to see if $A0($i$.$e$.$ bit $0$ of $A)$ is $1$ or not. Then, in the second repetition of the loop, you can AND the number A with $00000010b$ to see if A$1($i$.$e$.$ bit $1$ of A$)$ is $1$ or not. In order to get $00000010b$ from $00000001b,$ you can simply double the latter $($and you must figure out how to double a number when you don't have the multiplication operator$).$ Note: RSCPU throws away any carryout from the most significant bit when performing additions.

$\backslash$table$[[,$JUMP,Start$],[$A:$,$DB$,??$