11. This problem requires vou to design a module with five input bits m. r1,xo. u.o and three output bits 22, 21,20 Bits x1, To are interpreted as a 2-bit binary number X For example if x| = 1 and x0-0, then X x1x0-10 2. On the other hand if X1 = X0 1, then X = 3. Similarly Y is a 2-bit binary number y1y0. The input bit m (or mode bit) decides whether your logic works as an adder or comparator as described 150 points below Adder mode (m = 0): Here the output 222120 is a 3-bit number Z that represents the arithmetic sum X + Y. For example if X = 2 and Y-3, then when m = 0, the circuit will output Z = X + Y = 2+3 = 5 = 101 = 222120, that is, 22 = 20 = 1 and 21 = 0 Comparator mode (m 1): Here only output bits 2120 are used (as described below) 1Yo 01; if X > Y, then y/iyo 10. For example if X Y 2, then 222120d00 (here a d represents a don't care value). If X - 2 and Y - 3, the z2212o - d01. On the and has don't care values. If X-Y, then Y130 00: if X Y, then y/iyo 10. For example if X Y 2, then 222120d00 (here a d represents a don't care value). If X - 2 and Y - 3, the z2212o - d01. On the and has don't care values. If X-Y, then Y130 00: if X