TAKE NOTE: Please use C++ Program
PROGRAMMING TASK: MAKE CHANGE PROBLEM ANALYSIS AND ALGORITHM DESIGN Write a program that takes as input any change expressed in cents. It should then compute the number of half-dollars, quarters, dimes, nickels, and pennies to be returned, returning as many half-dollars as possible, then quarters, dimes, nickels, and pennies, in that order. For example, 483 cents should be returned as 9 half dollars, 1 quarter, 1 nickel, and 3 pennies. Input Change in cents. Output Equivalent change in half-dollars, quarters, dimes, nickels, and pennies. Applying this discussion to 646 cents yields the following calculations: 1. Change \( =646 \) 2. Number of half-dollars \( =646 / 50=12 \) 3. Remaining change \( =646 \) \& \( 50=46 \) 4. Number of quarters \( =46 / 25=1 \) 5. Remaining change \( =46 \) \& \( 25=21 \) 6. Number of dimes \( =21 / 10=2 \) 7. Remaining change \( =21810=1 \) 8. Number of nickels \( =1 / 5=0 \) 9. Number of pennies = remaining change \( =1 \) \& \( 5=1 \) VARIABLES NAMED CONSTANTS MAIN ALGORITHM TASK Complete the program listing using \( \mathrm{C}++ \). You should be able to perform the following test run. Sample Run: In this sample run, the user input is shaded. Enter change in cents: 583 The change you entered is 583 The number of half-dollars to be returned is 11 The number of quarters to be returned is 1 The number of dimes to be returned is 0 The number of nickels to be returned is 1 The number of pennies to be returned is 3