Answer: 462
Step-by-step explanation:
The general theorem of combination says that there are [tex]C(n+r-1, r)[/tex], with r-combinations from a set having n elements when repetition of elements is allowed.
Here the number of denomination: [tex]n = 7[/tex] , r =5
Also order doesn't matters.
Then the number of different possible ways can you choose the five bills is given by :-[tex]C(7+5-1, 5)= C(11,5)\\\\=\dfrac{11!}{5!(11-5)!}\\\\=462[/tex]
Hence, the number of different possible ways can you choose the five bills is 462.