Given a currency with denominations of 100, 50, 20, 10, 5 and 1 write a method MakeChange that takes an integer amount representing the total change to make and return an integer representing the smallest possible number of bills to return. For example a call of MakeChange(135) would result in a return value of 4 (1 one hundred bill, 1 twenty bill, 1 ten bill and 1 five bill). As part of a final solution please provide unit tests done as well as any test cases ran.

Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.