Provide a MATLAB code for Go Fish card game. In this game, each player is dealt 5 cards and the remaining cards form a draw pile. On the player’s turn, they request a card from an opponent’s hand to create a “match” with a card in the player’s hand. If the opponent has a matching card, it is given to the player. If the opponent does not have the requested card, the player “fishes” from the draw pile for a matching card. Then it is the opponent’s turn. The game continues until all the cards have been matched or when a player's hand is empty. The winner is the player with the most matched cards.

Texas Hold  em poker game 2 to 8 human or computer players Each player has a name and stack of chips Computer players have a difficulty setting: easy, medium, hard Summary of each hand:o Dealer collects ante from appropriate players, shuffles the deck, and deals eachplayer a hand of 2 cards from the deck.o A betting round occurs, followed by dealing 3 shared cards from the deck.o As shared cards are dealt, more betting rounds occur, where each player can fold,check, or raise.o At the end of a round, if more than one player is remaining, players' hands arecompared, and the best hand wins the pot of all chips bet so far. What classes are in this system? What are their responsibilities? Which classes collaborate?   Create the Use Cases for this systemCreate a Use Case diagram for this system Draw a class diagram for this system. Include relationships between classes (generalization andassociational).

[Python Language] Using loops of any kind, lists, or Sets is not allowed. Sloan’s Book Collection Sloan loves reading books. She recently started reading an AI generated series called “Harry Trotter”. Sloan is collecting books from the series at her nearest bookstore. Since the series is AI generated, the publishers have produced an infinite collection of the books where each book is identified by a unique integer. The bookstore has exactly one copy of each book. Sloan wants to buy the books in the range [l,r], where l ≤ r. As an example, the range [−3,3] means that Sloan wants to buy the books  − 3,  − 2,  − 1, 0, 1, 2, and 3. Pam also loves the series (or maybe annoying Sloan– who knows, really), and he manages to sneak into the bookstore very early to buy all of the books in the range [d,u], where d ≤ u. When Sloan later visits, sadly she will not find those books there anymore. For example, if Sloan tries to buy books [−2,3] and Pam has bought books [0,2], Sloan would only receive…

Suppose that you are given an n × n checkerboard and a checker. You must move the checker from the bottom edge of the board to the top edge of the board according to the following rule. At each step you may move the checker to one of three squares: 1. the square immediately above 2. the square that is one up and one to the left (but only if the checker if not already in the leftmost column) 3. the square that is one up and one to the right (but only if the checker is not already in the rightmost column). 1 Each time you move from square x to square y, you receive p(x, y) dollars. You are given p(x, y) for all pairs (x, y) for which a move from x to y is legal. Do not assume that p(x, y) is positive. design a recursive backtracking algorithm that determines the maximum amount of money you can recieve, when moving a checker frmo somewhere on the bottom row to somewhere on the top row.  your algorithm is free to pick any squrre along the bottom row as a starting point and any square along…