Problem: Card game $-$Match exactly $15$

This is a $4-$player card game where each player will have $10$ cards in the form of $5$ cards in a stack and the next $5$ cards in a queue from a deck of $52$ cards. There will also be $4$ cards on the table face up$.$

In each player$$s turn, the player will try to make a total point of exactly $15$ by adding the number of the top card in the player$$s stack and the number of one of four cards on the table. If none of the cards on the table adds up to exactly $15,$ then the player can dequeue $($player$$s choice, if wants to swap$)$ one card from the player$$s queue and swap it with the top card of the player$$s stack $($the top card from the stack must be enqueued to the player$$s queue$).$ After swapping $($if performed by the player$),$ if the top card still does not make a total point of exactly $15,$ then the player$$s card from the top of the stack will be popped and discarded, and enqueued back to the deck. Otherwise, for the match of point $15,$ the player will get $15$ points, and both the cards that add up to $15$ will be discarded from the stack and the table and enqueued back to the deck. The table will be refilled from the deck.

After five rounds of play the stacks of each player will be empty and the game ends. At this point, the player$($s$)$ with the highest points will be the winner$($s$).$

Initial Setup:

$($A$)$ The game consists of a deck of $52$ cards with $4$ sets. Each set contains cards numbered $1$ to $13$ with a specific color. Our deck has $$RED$($R$),$ GREEN$($G$),$ ORANGE$($O$),$ and PURPLE$($P$)$ colors. Example cards: $1$R$,10$G$,3$O$,13$P$,$ etc.

$($B$)$ An initial queue called deck of size $52.$ The cards will be stored in this queue.$$

$($C$)$ Each player $($Players $1$ to $4)$ has a dedicated stack and queue with a size of $5$ each. For player i$,$ we called them stack$\_$i and queue$\_$i$.$ These stacks and queues function like personal zones where players accumulate cards and play during the game.

$($D$)$ Create classes for a bounded stack and a bounded queue called Stack and Queue, respectively. Then, create each instance of these classes as required.$$

$($E$)$ A table with a list of $4$ cards face up on the table.$$

$($F$)$ Implement your solution with modularization using functions.$$

The final score of the players will also be stored in a $$game$\_$score.txt$$ file with the below format:

$$Scores:

$$Player$\_1=0\mathrm{.}0$;

$$Player$\_2=30\mathrm{.}0$;

$$Player$\_3=0\mathrm{.}0$;

$$Player$\_4=15\mathrm{.}0$;

$$Player $2$ wins!

$$ Or

$$Player$\_1=0\mathrm{.}0$;

$$Player$\_2=15\mathrm{.}0$;

$$Player$\_3=0\mathrm{.}0$;

$$Player$\_4=15\mathrm{.}0$;

$$Player$($s$)2$ and $4$ wins!

$$Or

$$Player$\_1=15\mathrm{.}0$;

$$Player$\_2=15\mathrm{.}0$;

$$Player$\_3=15\mathrm{.}0$;

$$Player$\_4=15\mathrm{.}0$;

$$It$\text{'}$s a tie! No one Wins!

Solve it using python and give exact output and formatting of the tables of players as shown in sample output