data structures

Consider a deck of playing cards. Define a total order that allows for the comparison of any two cards in the deck. (How does a 10 of hearts compare to a 10 of clubs?) Define a Python class Card that implements the total order you defined. For instance, the class Card may include a method compareTo(anotherCard). So, if cl and c2 are instances of Card, cl.compareTo(c2) returns one of the values -1, 0 and 1, indicating that the card cl is less than, equal to or greater than the card c2. Alternatively, you may overwrite the Card methods _lt 0,-le etc Write a Python client program using the class Card that you designed that reads a sequence of cards, creates Card instances for each of the read cards stores them in a list and then finds and outputs a smallest and a largest card (relative to the order you defined)