Task: Create a state machine for the following programing problem:

Case Study: This deck of cards will be used to create the card game '500'. It is not necessary to understand the detailed rules for scoring in this game, but you do need to understand how the game proceeds (see the design scope below). A full deck of cards has 52 cards. There are 4 suits (Hearts, Diamonds, Spades and Clubs). Each suit has cards numbered from 1 (Ace) to 10, then Jack, Queen and King. The deck for this game must include one Joker - which does not belong to any suit.

A subset of the complete deck is used to play this game, comprising of 43 cards (some of the lower value cards are left out).

To play the game, the deck is shuffled and dealt out to players as follows: each of the four players gets a hand of 10 cards, and 4 cards are left in the 'kitty'. No cards are visible until players get their hand. Players need to be able to turn over their cards to see the value of each card. One player is allowed to swap selected cards from their hand with the kitty. To play, each player in turn takes one card from their hand and places it on a pile (in the game this is sometimes called a 'trick'). There is a complicated scoring system to decide which player wins each 'trick'.

Design Scope For this assessment you do NOT need to model all the required processes. The processes which should be included are: ? create the game with 4 players and the deck ? deal cards (which should create the kitty and 4 instances of a 'hand' of cards) ? play one 'trick' of a game (where each player places a card on the table, and a winner is decided). (Note that a 'round' is just a repeat of this process until all cards have been played.) Additional processes (which are NOT needed for this assessment) could involve the bidding process, tallying the score for each player, starting a new round, etc. State Machine Diagrams are not always necessary in UML modelling. For this assessment you only need ONE State Machine Diagram. One suggestion is that you could use a state machine to model the states of a 'deck'. Think about what happens to a deck - it can be shuffled or sorted or it may be empty (after all cards have been dealt). You should not be able to deal from a deck that is not shuffled, or is empty.