Dealing Card Using Java

I. INTRODUCTION: This project applies the concepts of random number generation, multi-dimensional array and bit-mapped technique. ll. DESCRIPTION A deck of playing cards has four suits which are Spade (A Mu2660''), Heart (v-mu2665), Diamond -u2666), and Club 1u2663). Each suit has 13 cards in the order of 12, 3 9, 10, J, Q, K, A) and this is called the rank of the card. Most card games do not rank suits; the ace of clubs is just as good as the ace of spades However, there are occasions that the ranking of the suits needs to be decided. Please be reminded that no standard of ranking of suits exits. However, in this project we are going to use the Reverse Alphabetical order convention: clubs (lowest), followed by diamonds, hearts, and spades (highest). This ranking is also used in the game of bridge. Ill. ASSIGNMENT Write a JAVA program according to produce the output similar to the following according to the steps specified below: EAST A 10 3 V: A 9 8 A Q J Q 10 86 NORTH V: K 10 7 10 9 8 7 6 2 4 J 4 3 WEST 4 Q 6 5 6 5 4 3 2 4 3 K 7 2 SOUTH K J 9 8 7 4. Q J K 5 4 A 9 5 OK