Part $2-$ Design of Boolean Logics

Gray code $($GC$)$ is a binary code that ensures that from one transition to another, there is only a

single one$-$bit value that changes, as ilustrated with the following Truth table. We aim to design

a Ray code corversion system.

For each GC output named $F$ in $(F_2{F}_2{F}_1{F}_2)$

b$.$ Derive the product of sum canonical form of $F$ then write $F$ using maxterms using the same K$-$map