Complete the following functions and use them to complete the program so that is allows to people at the same keyboard to play a game of Rack$-$O$.$

def get$\_$rack$($deck$,$ rack$\_$size$)$:

Deal the top rack$\_$size cards $($first rack$\_$size elements of the list$)$ of the deck into a new rack. We expect rack$\_$size to be between $5$ and $10.$ The first card goes in the first slot, the second card goes in the second slot, and so forth. We assume len$($deck$)>=$ rack$\_$size. Return the list of ints representing the rack.. deck is a list of ints and rack$\_$size is an int between $5$ and $10$ inclusive.

def take$\_$turn$($deck$,$ discard, player$\_$rack$)$:

Take the player's turn. Give them the choice of drawing or taking the top card of the discard pile. If they draw they can replace a card or discard the draw. If they take the top card of the discard pile they must replace a card in their rack.

The parameter deck is a list of int represented the deck, discard is a list of ints representing the discard pile, and player$\_$rack is a list of ints representing a player's rack

def place$\_$card$($player$\_$rack, new$\_$card, discard$)$:

Ask the player which card to replace in their rack. Replace it with the given new card. Place the card removed from the player's rack at the top of the discard pile. Error checks until player enters a card that is currently in their rack.

The parameter player$\_$rack is a list of ints representing the player's rack of cards, new$\_$card is an it$,$ and discard is a list of ints representing the discard pile

def is$\_$sorted$($rack$)$:

Return True if this rack is sorted in ascending order, False otherwise. Do not create any new lists in this function. This means you are not to call the built in sorted function which creates a new list when called. The parameter rack is a list of ints