1. In this question you will implement a system that receives as input 3 variables A, B, C, each variable consisting of k bits, and a flag variable F consisting of 2 bits; and outputs a k bit variable Y based on the following rules. In what follows, A, B, C, and Y are considered to be in 2's complement fornm with k bits and X stands for the absolute value of X. (a) If F 00 then theoutput Y wll check if the inputs A, B, C and their sums (or differences) can be represented in 2's complement form with k bits. Namely, Y = 000 . . . 000 if IAHBHC 2r_1 and Y 1 otherwise. (b) F 01 then the otput Y will be equal to the input with the largest value in 2's complement form). Namely, if A is larger than B and C then Y will be equal to A. Similarly, if B is largest Y wil be equal to B, and if C is largest Y will be equal to C. Ties can be broken arbitrarily. (c) If F = 10 then the output Y will compare between the values lA] + BI-ICl and L1+ B-CL Namely Y = 000 . . .000 if IA] + IB?-IC2 l/1+ B-Cl and Y = 111 . . . 111 otherwise. (d) If F 11 then the output Y will be equal to the product of A2o) and BoHere, A20) and B20 are the 3 least significant bits of A and B respectively (you may assume k 2 3). In this case, the values of A2o, B2o), and Y are considered to be in standard binary form Construct a circuit that performs the above functionality. Draw the circuit i an organized and readable manner. Up to 50 points will be reduced for solutions that are unorganized and difficult to understand. It is recommended to present the circuit in a modular manner (see figure below). In your circuits, you may use any component covered in the class lectures details of circuit circuit circuit circuit details of circuit My circuit and so on. 1. In this question you will implement a system that receives as input 3 variables A, B, C, each variable consisting of k bits, and a flag variable F consisting of 2 bits; and outputs a k bit variable Y based on the following rules. In what follows, A, B, C, and Y are considered to be in 2's complement fornm with k bits and X stands for the absolute value of X. (a) If F 00 then theoutput Y wll check if the inputs A, B, C and their sums (or differences) can be represented in 2's complement form with k bits. Namely, Y = 000 . . . 000 if IAHBHC 2r_1 and Y 1 otherwise. (b) F 01 then the otput Y will be equal to the input with the largest value in 2's complement form). Namely, if A is larger than B and C then Y will be equal to A. Similarly, if B is largest Y wil be equal to B, and if C is largest Y will be equal to C. Ties can be broken arbitrarily. (c) If F = 10 then the output Y will compare between the values lA] + BI-ICl and L1+ B-CL Namely Y = 000 . . .000 if IA] + IB?-IC2 l/1+ B-Cl and Y = 111 . . . 111 otherwise. (d) If F 11 then the output Y will be equal to the product of A2o) and BoHere, A20) and B20 are the 3 least significant bits of A and B respectively (you may assume k 2 3). In this case, the values of A2o, B2o), and Y are considered to be in standard binary form Construct a circuit that performs the above functionality. Draw the circuit i an organized and readable manner. Up to 50 points will be reduced for solutions that are unorganized and difficult to understand. It is recommended to present the circuit in a modular manner (see figure below). In your circuits, you may use any component covered in the class lectures details of circuit circuit circuit circuit details of circuit My circuit and so on