Consider a game in which a single player is given three dice to roll and then is dealt 3 cards from a deck of only the spades (i.e. the 13 cards: 2-10, Jack, Queen, King, and Ace, all of spades) where Aces are considered the highest card. However, the three cards are dealt in this manner: the first card is dealt, its name is recorded, it is returned to the deck, and the deck is reshuffled before the next card is dealt. (this is called dealing the cards "with replacement" and it means that a player could end up with duplicate cards among their three). Design a computer simulation that replicates this procedure and use your simulations to do the following (simulations should include at least 5000 trials):Using your simulation results calculate an estimate of the probability that the sum of the dice is 10 and the player is dealt three cards that can be put in sequence (Be careful. Aces are assumed to be high, so {3,Ace,2} cannot be put in sequence, but {Ace,Queen, King} can be).