2nd problem: An arithmetic network has 2 of 4-4 bits long input operands (A3,..A0, and B3,..B0, where the operands are unsigned positiv numbers, and A3 and B3 are the MSBs). The network presents an 8 bits long result (S7,S6,..S0 2nd complement representation), executs the next operation:
S = 3 * A –5 * B, if A >= B 9 * B - 10 * A, if A < B
You may apply the next MSI circiuts: 4 bits comparator with cascade inputs, 4 bits parallel adder, 4 * 1 /2 multiplexer and any number and type of logical gates and flip-flops.