Please note: The above question is the one I want answered. I don't need any actual code in any languages, this class strictly works in a type of pseudocode that can be found in the textbook "Discrete Mathematics and its Applications" by Kenneth H. Rosen. An example of the type of pseudocode is shown in the picture below.

Questions 1-3 are about the Duodec-1 computer, manufactured by the Duosomata Computer Corporation. It has 12-bit words and represents integers in two's-complement form 3. (10 points.) Write an algorithm that takes a 12-bit, two's complement integer k as its input, where k20. Your algorithm must use the div and mod operators to count the number of 0-bits in k. For example, if k-0000 0000 0000, then your algorithm must count 12, and if 10011, then y just these examples!) You must also briefly explain how your algorithm works