3.25 lab: exact change write a program with total change amount as an integer input, and output the change using the fewest coins, one coin type per line. the coin types are dollars, quarters, dimes, nickels, and pennies. use singular and plural coin names as appropriate, like 1 penny vs. 2 pennies. ex: if the input is: 0 (or less than 0), the output is: no change ex: if the input is: 45 the output is: 1 quarter 2 dimes

Problem 3: (hand) write the member function implementations for the class hand, which simulates a hand of 2 cards, into the file hand.cpp. the relative strength of 2 hands are determined by the following rules: • a pair (two cards of the same number) is the strongest hand. • two cards of the same suit is the next strongest hand. • two cards of different numbers and suits is the weakest hand. • within the same kind of hands, the stronger hand is determined by the larger number. • if two hands are of the same kind and the larger numbers are the same, the stronger hand is given by the hand whose smaller number is larger. • if all above fails, the two hands are of equal strength. i.e., all suits are of equal strength. • 2 is the weakest number. an ace is stronger than a king. you are using a single deck of cards. so a hand of a♥a♥ is impossible. here are some examples: