Write a program with total change amount (in cents) as an integer input, and output the change using the fewest coins, one coin type per line. The coin types are Dollars, Quarters, Dimes, Nickels, and Pennies. Use singular and plural coin names as appropriate, like 1 Penny vs. 2 Pennies. Hint: Start from the largest denomination. Divide the change amount by the number of cents in the denomination to get the number of coins used. The remainder of the division is used to find the number of coins used in the next denomination. Ex: value // 100 gives the number of dollars used. The remainder is divided by 25 to find the number of quarters used. Ex: If the input is: 0 (or less than 0), the output is: No change Ex: If the input is: 45 the output is: 1 Quarter 2 Dimes

Write a program that converts a positive integer into the Roman number system. The Roman number system has digits Arabic Roman 1 I 5 V 10 X 50 L 100 C 500 D 1000 M Numbers are formed according to the following rules: a. Only numbers between 1 and 3,999 are represented. b. As in the decimal system, the thousands, hundreds, tens, and ones are expressed separately. c. The numbers 1 to 9 are expressed as Arabic Roman 1 I 234567 || |||| IV V VI VII 8 VIII 9 IX As you can see, an I preceding a V or X is subtracted from the value, and you can never have more than three I's in a row. d. Tens are expressed as Arabic Roman 10 X 20 XX 30 XXX 40 XL 50 L 60 LX 70 LXX 80 LXXX 90 XC As you can see, an X preceding a L or C is subtracted from the value, and you I can never have more than three X's in