Problem $4-25$ pts

a$.$ Reproduce the truth table of a $2-$bit unsigned comparator, shown below $($also refer to Section $6\mathrm{.}2$ of your textbook$)(5$ pts$)$

$\backslash$table$[[a_1{a}_0,b_1{b}_0,$G E L$],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,],[,,]]$

b$.$ We want to expand into a $4-$bit comparator $($shown above$)$ using two such $2-$bit comparators as in the previous step. Complete the truth table for the "wrap$-$around logic block". Hint: Remember that one and exactly one of the G$,$ E$,$ L outputs of a comparator is $1.(10$ pts$)$

$\backslash$table$[[$Gin$\_$h$,$ Ein$\_$h$,$ Lin$\_$h$,$Gin$\_$l$,$ Ein$\_$l$,$ Lin$\_$l$,$G E L$],[,,],[,,]]$

c$.$ Implement the wrap$-$around logic for $G,E,L$ using basic gates. $(10$ pts$)$