Greedy Coins Used

Write greedy_coins_used(amount: int, coins: list[int]) -> list[int] that returns the list of coins a greedy cashier hands out: go through the coin values from largest to smallest (the starter orders them with sorted(coins)[::-1]) and, while the current coin still fits in remaining, append it to used and subtract it. The coins always include 1, so the amount is always reached. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, the amount and then the space-separated coin values; the tests print the list your function returns.