Answer to Question #7170 in C++ for selvin

Question

Write a set of detailed, step-by-step instructions in English to calculate the fewest number of dollar bills needed to pay a bill of amount TOTAL. For example, if TOTAL is $97, the bills would consist of one $50 bill, two $20 bills, one $5 bill, and two $1 bills. (For this exercise, assume that only $100, $50, $20, $10, $5, and $1 bills are available

*Note* We will add a $2 bill in addition to the one given in the original problem and to simplify matters, you will all work with a sum of $283.00Planning and Design: -
a]You will have to hand in a structure chart that should show how you have broken down the problem into manageable pieces, so that the final solution can be easily achieved with a computer program.
,we will concentrate only on Sequence and Abstraction. Do NOT attempt to invoke, Selection or Iteration. These will come later.
Make sure you follow our convention.
b]You will also have to submit an appropriate algorithm, that reflects the analysis
C]design a list of all the variables