A cashier in a supermarket returns change to customers. Suppose we want to write a program to help the cashier find the possible combinations of coins that sum up to the change. Assume that the coin units available are 1, 2, and 5 Qurush (â‚©) where there is an infinite supply of every coin. Write a method that receives the amount of change to be paid to the customer and then prints the different combinations by which the change can be paid to the customer. Write a program to test this method.
Example: If the change is 7, then the different combinations are: 111 | 1, 1112 | 1122, 12 | 22, 115, 2 | 5.