For making change problem, you have a set of coins in {100, 25, 10, 5, 1}, which is the first one you select for the amount of 65 using greedy algorithm? a. 100 b. 25 c.10 d. 5

7. design a circuit with three inputs (x, y, and z) representing the bits in a binary number, and three outputs (a, b, and c) also representing bits in a binary number. when the input is 1, 2, or 3, the binary output should be one lesser than the input. when the input is 4, 5, or 6, the binary output should be one greater than the input. when the input is 0, the output is 0, and when the input is 7, the output is 7. show your truth table, all computations for simplification, and the final circuit.