Best Instruction Manual Template | Free & Editable in Bit.ai

a) Show that this algorithm determines the number of 1 bits in the bit string S : procedure bit coumt S : bit string) coumt tan while S ≠0 begin count : coumt 1 S:=S ∧(S-1) end {count is the number of 1 s in S] Here S-1 is the bit string obtained by changing the rightmost 1 bit of S to a 0 and all the 0 bits to the right of this to 1 s [ Recall that S ∧(S-1) is the bitwise A N D of S and S-1 . ) b) How inany bitwise A N D operations are needed to tind the number of 1 bits in a string S ? | Nume