java programming..OOP...please solve according the question in different classes

It is said that if a deck of cards is given perfect shuffles enough times, it will return to its original order. A perfect shuffle is done by splitting the deck exactly in half and interleaving the cards from the two halves; that is, the first card is from the first half, the second from the second half, the third from the first half, and so on. For example, C. Initial State: AH 2H 3H 4H 5H 6H 7H 8H 9H 10H JH QH KH AC 2C 3C 4C 5C 6C 7C 8C 9C 10C JC QC KC AD 2D 3D 4D 5D 6D 7D 8D 9D 10D JD QD KD AS 2S 3S 4S 5S 6S 7S 8S 9S 10S JS QS KS After first shuffle: AH AD 2H 2D 3H 3D 4H 4D 5H 5D 6H 6D 7H 7D 8H 8D 9H 9D 10H 10D JH JD QH QD KH KD Create a Deck class with the following methods . Deck) constructor that creates an unshuffled deck. .A shuffle) method that does a perfect shuffle. A toStringO method that print the deck as shown above. An equals(Deck aDeck) method that compares itself with the given deck and returns true if all the cards in both decks are in the same order and false otherwise