See task bellow

Background: Suppose a bank’s teller has asked you to convert a monetary amount into the types of bills and coins required to issue that amount. For this task, assume the bank has an infinite supply of the following bills: $1, $5, $20, and infinite supply of the following coins: 1c, 5c, 10c, 25c, 50c, but has no other denominations. The bank’s teller has also asked you to ensure that the minimum number of coins and bills be used in each transaction. ! It is guaranteed that using the following method to compute the number of coins and bills will result in the minimum number of coins and bills required. The idea is to use as much of the largest possible denomination at any point. First let’s consider whole dollar amounts. So for example, you need bills for $113 dollars. The largest possible denomination that you can use is $20 - five of those. Therefore, you can use 5 $20 bills to accumulate $100. Now the next possible denomination is $5 - two of those. This brings the total to $110, with a total of 7 bills. Now use three $1 bills to bring the total to $113. Similarly, you can produce $22 by using 1 ×$20 and 2×$1 bills Note that after using the $20 dollar bill, the largest denomination we can use is $1, not $5. Make sure you keep this in mind when programming this task. A similar strategy can be used for coins. For example, $63.56 can be issued as 3×$20 = $60, 3×$1 = $3, 1×50c = $0.5, 1×5c = $0.05 and 1×1c = $0.01. ! Task: Write a program that accomplishes the above required task. Your program should output a well formatted sentence. For $22.65 as input, it should say: ! Enter Amount: 22.35! You need 1 $20 bill, 2 $1 bills, 1 50c coin, and 3 5c coins.! ! [Note that this strategy of minimizing the number of bills and coins works only if each denomination is no more than half the value of the one greater than it.]