Recall that there are three other Boolean unary operators besides Boolean negation. Can you produce a circuit diagram for each of these?

The other three Boolean unary operators are trivial in the sense that they do not need a digital device at all. So the three circuit diagrams can be produced by: