Design a combinational circuit that divides a 2-bit number A = (a ao) by another 2- bit number B= (b bo) and generates a 2-bit number D = (d do) that gives the remainder of the division (i.e. D = A%B). Note that division-by-0 is not defined; therefore you can assume that the input combinations causing division-by-0 are not applied. a. Derive the truth table. a1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 do 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 b 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 bo 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 d do b. Implement d, output using the smallest multiplexer. Do not use any other gate. Do not draw the circuit; just show the selection inputs (S.) and data inputs (I) of the multiplexer.