$3\mathrm{.}58$ The following transistor circuit produces the accompanying truth table. The inputs to some of the gates of the transistors are not specified. Also, the outputs for some of the input combinations of the truth table are not specified.

Your job: Complete both specifications. That is$,$ all transistors will have their gates properly labeled with either $A,B,$ or $C,$ and all rows of the truth table will have a $0$ or $1$ specified as the output.

Note that this is not a problematic circuit. For every input combination, the output is either connected to ground $($i$.$e$.,$ OUT$=0)$ or to the positive end of the battery $($i$.$e$.,$ OUT$=1).$

$\backslash$table$[[$A$,$B$,$C$,$OUT$],[0,0,0,],[0,0,1,],[0,1,0,],[0,1,1,1],[1,0,0,1],[1,0,1,0],[1,1,0,],[1,1,1,]]$