I created the variables for the boolean question

sets. Overall, the problems make sense. However, I would
love to now more about the sequence of problem solving through these. I
found myself struggling a lot to find a logical way to work through them.

I started by writing down the a and b bytes and just somewhat randomly,
trying different solutions. Knowing CS, there has to be a more
efficent way of breaking down these sequences and knowing how they are
deciphered.

From a teaching standpoint, these seem like fun riddles almost. I think
that when teaching the idea of bits, bytes, and booleans, it would be a really
fun opportunity to race and problem solve as a team.

questions.md

@@ -21,16 +21,28 @@ The answers to the first two questions are given.
 
 3. 00000001
 
+a & ~a
+
 4. 10000000
 
+a
+
 5. 01010000
 
+b & ~a
+
 6. 00001010
 
+b & a
+
 7. 01010000
 
+b & ~a
+
 8. 10101011
 
+b ^ a 
+
 ## Integer questions
 
 These questions are difficult! Try exploring ideas with `Bits`