Write a program that prompts for and reads a value representing a monetary amount. Then determine the fewest number of each bill and coin needed to represent that amount, starting with the highest $($assume that a ten$-$dollar bill is the maximum size needed$).$ For example, if the value entered is $47\mathrm{.}63($forty$-$seven dollars and sixty$-$three cents$),$ then the program should print the equivalent amount as: