Repeat the steps in code conversion example for conversion from Gray code to BCD$.$ Consider only decimals from $0$ to $9.$

Truth table $,4$ K$-$map $,$ Boolean expressions $,$ Logic diagram $,$ simplified logic diagram. First, you will get Boolean expressions and draw them as separate logic diagrams. Then, similar to code conversion example, you will reduce the gates that you have used to minimum and then you will draw another logic diagram $($single one$)$ including all inputs and outputs.