Problem $5$

Decoder Truth Table

Logic circuit Truth Table

The logic circuit above consists of three logic gates, a multiplexer, and a decoder. The inputs to the circuit are A and B$,$ and the outputs are $\backslash ($ Y$\_\{0\}\backslash )$ through $\backslash ($ Y$\_\{3\}\backslash ).$ The truth table on the right$-$hand side contains the input values for various states, along with example outputs for $\backslash ($ Y$\_\{0\}-$Y$\_\{3\}\backslash )$ when $\backslash (\backslash$mathrm$\{$A$\}=0\backslash )$ and $\backslash (\backslash$mathrm$\{$B$\}=0\backslash ),$as shown in the state table for reference. Note that $\backslash (\backslash$mathbf$\{1\}\backslash )$ and $\backslash (\backslash$mathbf$\{0\}\backslash )$ represent high and low logic states, respectively, and the truth table of the decoder is attached above.

A$)$ Using the given input logic states of A and B in the first two columns, complete the output logic states for $\backslash ($ Y$\_\{0\}\backslash )$ through $\backslash ($ Y$\_\{3\}\backslash )$ in the red block. $(12$pts$)$