rations. (It’s straightforward to convert your answers into circuits.) Consider a number x ∈ {0, . . . , 15} represented as a 4-bit binary number, as shown in Figure 3.9. Denote by x0 the...

rations. (It’s straightforward to convert your answers into circuits.) Consider a number x ∈ {0, . . . , 15} represented as a 4-bit binary number, as shown in Figure 3.9. Denote by x0 the least-significant bit of x, by x1 the next bit, and so forth. For example, for the number x = 12 (written 1100 in binary) would have x0 = 0, x₁
= 0, x₂
= 1, and x₃
= 1). For each of the following conditions, give a proposition over the Boolean variables {x₀, x₁, x₂, x₃} that expresses the stated condition. (Think of 0 as false and 1 as true.)