A two$-$out$-$of$-$five $cod{e}^1(2O5)$ is an encoding of decimal digits to $5$ bits where

each $5-$bit sequence has exactly two $1\text{'}$s$.$ An error with this encoding can be easily

detected if the number of $1\text{'}$s is not equal to $2.$ Such a code may have an

advantage over BCD in some scenarios.

Design a combinational circuit that converts a $BCD$ digit to a $2O5$ digit

$($consisting of $5$ bits$).$ Complements are available. You may only use AND, OR$,$

XOR, EQV gates.