1. Deck.javaThe Deck class represents a deck of cards. It starts off with 52 cards, but as cards are dealt from the deck.the number of cards becomes smaller. The class has one private instance variable that stores the Cardsthat are currently in the Deck:private Card] carde;Important Note: The first Card in the array will be considered the card that Is at the top of the deck.Whon cards aro removed from the deck they will be removed from the front of the array. You mustimplement the flollowing methods for the Deck class:• public Dock) This constructor initializes the Deck with 52 card objacts, representing the 52 cardsthat are in a standard deck. The cards must be ordered as in the diagram below: Important: TheFIRST card in your array should be the Ace of Spades, and the LAST card should be the King ofDiamonds. Note that in the picture below, the Ace of Spades is at the TOP of the deck, which is tothe left.A234567890 J.0KA2345672545610KA2 S45 57|8|90U.0高• public Deck(Deck other) Standard copy constructor. Note that it is okay to make a shallow copyof the array of cards. (The Card class is immutable, so alineng Cards is not a problem.)• public Card getCardAt(int position)- Returns the card that is at the specified position in the array(Uses the usual 0-based indexing.)• public int getNumCards)- Returns the szo of the array of Cards. (It starts off equal to 52, butbecomes smaller as cards are dealt from the deck.)• public vold shuffle() - This method will re-arrange the cards that are in the deck. The idea is that thedeck will be divided into two packets" the top half and the bottom half, The new array of cardswill consist of: the first card from the top packet, followed by the first card from the bottom packet,followed by the second card from the top packet, followed by the second card from the bottompacket, etc. Important: If there are an odd number of cards, the top packet should have one morecard than the bottom packet. Remember that the top of the deck is considered to be the front of thearray. In the pictures below, remember that the top of the deck appears at the left side. Beloware two examples of how the shuffle should work.Example 1 (even number of cards):Before ShufflingA2G45078904551900 413/2021Proea 7ProjedAfter Shuffling- Copy the cards that are not being dealt from the original array into the new one.Assign the instance variable "cards" so that it refers to the new arrayS536272 PokerHandEvaluator.javaThis dass consists of several static methods that you will write. The prototypes for the methods are:public static boolean hasPair(Card cards)• public static boolean hasTwoPair(Card) cards)public static boolean hasThreeOIAKind(Card) cards)- public static boolean hasStraight(Card cards)• public static boolean hasFlush(Card) cards)public static boolean hasFullHouse(Card) cards)public static boolean hasFourOfAKind(Card) cards)Example 2 (odd number of cards):Before Shuffling567890789public static boolean hasStraightFlush(Card) cards)K NTESAfter ShufflingThe parameter for each of these methods will be an array of exactly 5 cards. Each method will return true or false,based on whether or not the given set of cards satisfies the poker hand being evaluated in the method. Forexample, the has TwoPair method will return true if the set of cards has two pairs of different values (e.g. a pair of4's and a pair of Jacks). If you need to review the various "poker hands' being tested in the methods, please takeanother look at the Poker Hand Page (pokerHands html).5 061950Important: Each of these methods checks whether or not the set of cards satisfies the given poker hand, but itdoes not care if it could also satisty a better hand. For example, if the current hand is• public void cutfint position) - This method divides the deck into two subpackets: The part abovethe specified position, and the part that is at the specified position or below. The two subpackets arereversed (the top packet is placed on the bottom and the bottom packet is placed on the top.) Theposition value uses 0-based Indexing as usual, so the card at the top of the deck (to the left in thediagrams) is at position 0. Here is an example:then the results of calling each method should be as indicated below:hasPair -- true (there is at least one pair)hasTwoPair- true (there are two pairs of distinct values)• hasThreeOfAKind - true (there are three Aces)Before cutA23456789OJALA234567890OTA234567890J0KA23456789DOCKhasStraight -- false• hasFlushfalsehasFullHouse -- true (there are three Aces and two Jacks -- that makes a "full house"). hasFourOtAKind -- false• hasStraightFlush- falseAfter cutting at position 4. (The 5 of spades was at position 4 in the diagram above.)Important: In order for a hand to quality as "Two Pair", it must have two pairs of distinct values -- in particular,having four-of-a-kind does not also count as two pair. For example, if the current hand is567890J0EAZS436799)89JOKA2 542 of diamonds, 2 of spades, 2 of hearts, 2 of clubs, 9 of spades>then the results of calling each method should be as indicated below:• public Card deal(int numCards) - This method will remove the specified number of cards from thetop of the deck and return them as an array. For example, it the parameter is 4, then the first fourcards in the deck will be returned as an array of size 4. Important: The cards will be removed fromthe front of the 'cards" array, not the back. Hint: The 'cards" array will need to be resized. Here is theidea:• hasPair- true (there is at least one pair)• hasTwoPair -- false (there are not two pairs of distinct values). has ThreeOfAKind-- true (there are three 2's)• hasStraight -- false• hasFlush - false• hasFulHouse-- false• hasFourOtAKind - true (there are four 2's)• hasStraightFlush - false• Make a new array (call it "smaller) that is the same size as the current deck of cards minus thenumber of cads being dealt.

Program Files filename: Driver.java package poker; public class Driver { public static void…

1. Deck.java The Deck class represents a deck of cards. It starts off with 52 cards, but as cards are dealt from the deck. the number of cards becomes smaller. The class has one private instance variablo that stores the Carde that are currently in the Deck: private Card] cards; Important Note: The first Card in the array will be considered the card that is at the top of the deck. When cards aro removed from the deck they will be removed from the front of the array. You must implement the following methods for the Deck class: • public Deck0- This constructor initializes the Deck with 52 card objects, representing the 52 cards that are in a standard deck. The cards must be ordered as in the diagram below: Important: The FIRST card in your array should be the Ace of Spades, and the LAST card should be the King of Diamonds. Note that in the picture below, the Ace of Spades is at the TOP of the deck, which is to the left. A234567890J 567890 • public Deck(Deck other)- Standard copy constructor. Note that it is okay to make a shallow copy of the array of cards. (The Card class is immutable, so alinsing Cards is not a problem.) • public Card getCardAt(int position) - Returns the card that is at the specified position in the array (Uses the usual 0-based indexing.) • public int getNumCards)- Returns the sizo of the array of Cards. (It starts off equal to 52, but becomes smaller as cards are dealt from the deck.) • public void shuffle()- This method will re-arrange the cards that are in the deck. The idea is that the deck will be divided into two "packets the top half and the bottom half. The new array of cards will consist of: the first card from the top packet, followed by the first card from the bottom packet, followed by the second card from the top packet, followed by the second card from the bottom packet, etc. Important: If there are an odd number of cards, the top packet should have one more card than the bottom packet. Remember that the top of the deck is considered to be the front of the array. In the pictures below, remember that the top of the deck appears at the left side. Below are two examples of how the shuffle should work Example 1 (even number of cards): Before Shuffling A234567890 5456