Question 6-7 please, and according to chegg terms it is allowed as they are both apart of the deck of cards question

Please answer in C++

DECK OF CARDS The standard 52-card deck of French-suited playing cards is the most common pack of playing cards used today. A standard 52-card pack comprises 13 ranks in each of the four French suits: Clubs (*), Diamonds (), Hearts () and Spades (*), with reversible (double-headed) court cards (face cards). Each suit includes an Ace, a King, Queen and Jack, each depicted alongside a symbol of its suit; and numerals or pip cards from the Deuce (Two) to the Ten, with each card depicting that many symbols (pips) of its suit. Example set of 52 playing cards; 13 of each sult: clubs, diamonds, hearts, and spades Jack Queen King Ace 3 9 10 . Clubs A . . Diamonds Hearts Spades . Ref. Standard 52-Card Deck SEQUENCE OF CARDS John, Mike and Suzy head to the Carnival at Zootopia. They come across a stall named "Can You Pick 'em Right?!". The stall owner Mr X greets them and invites them to play his game and tells them that the winner will get a coupon worth $50 to spend in the Carnival. The three friends get excited and decide to play the game. Mr X starts to explain the game to the participants. The ultimate aim of the game is for the players to create a sequence by picking a set of cards which is similar to the sequence picked by the host, i.e., Mr X. He says that every player is free to choose up to a maximum of 10 cards to form their sequence. A sequence is formed by the cards picked by the players. The players select a subsequence of cards from their hand to compare against the golden sequence. The players cannot rearrange the cards, but can select a continuous subset that is the same length as the golden sequence. The game is played with multiple decks of cards. We know that in a deck of cards there are four suits: Spades (S), Hearts (H), Diamonds (D) and Clubs (C). And there are 13 ranks in each suit: Ace, 2-10, Jack, Queen and King. For the purpose of creating the sequence Ace is treated as the character A, Ten as T, Jack as J, Queen as Q and King as K. Formation of Sequences: First, the card's suit is taken and the letter representing that suit is added to the sequence. Next, the card's rank is taken and appended to the sequence. Similarly, the process is repeated for all the cards picked by the player in the order that they pick the cards. Let us assume that John has picked the following cards: Ace of Diamonds, 5 of Hearts, Ten of Spades, Queen of Clubs and the 6 of Hearts in the same order as specified. Therefore the sequence generated by John is as follows: DAHS STCQH6 Each player picks a maximum of 10 cards from which they can create their sequence. Once all the players have picked their cards, Mr X chooses his sequence of cards (without any knowledge of the cards picked by the players), which is going to be the Golden Sequence of cards. Mr. X can choose any number of cards less than or equal to 10. Let us assume that Mr X picks the following cards: Ace of Diamonds, 4 of Hearts, Ten of Spades, 8 of Hearts and 6 of Clubs. So the Golden Sequence is as follows: DAH4 STH8C6 Once the Golden Sequence is found, a Likeness Score between the sequences of the players and the Golden Sequence is found. And finally, the player with the highest Likeness Score is declared the winner Rules for Likeness Score While finding the likeness Score, more priority is given to the Sult of the cards rather than the Rank of the card. Rules include . First, the number of cards under consideration in the player's sequence and the Golden Sequence must be the same. So the player has picked 10 cards, while the Golden Sequence has only 5 cards, then sub-sequences of cards from the original sequence must be obtained. Something like this: Golden Sequence Player's Sub-Sequences To be considered HAD2S3C4850687CHCI HAD2S3C4H5D65CHICT HAD233C4850687cHCT H6CBSJDKS3 HAD233C4A5D6S7C8H9CT HAD23CA85D6S7C89C HAD2S3CA5D6S7C8H9CT . When the two sequences to be considered are available, The suit of the first card in both sequences are taken into account if the suit is the same, then we keep track of those positions where the suit of the card is the same, Next, if and only if the sult of the cards under consideration is the same, we look at the rank of the card. If the rank of the cards are also the same, a bonus point of 1 for every such match) is added in the calculation of the Likeness Score Finally, once all the cards have been compared, the averal Liness Score is calculated as follows: Likeness Score (Mamber of Cards where the suit is sane/ Number of Cards ) Number ( 1 Number of Cards with Same Suit and Sane Rank) Example: Let us look at John's sequence and the Golden Sequence Cards Player Sequenc/Sub Sequence DAH 5 STCQH 6 Not Considered diferent leading to no bonus although and Golden Sequence D AH 4 STH8C6 Not Cordered suit is different leading to no bonus Consideredt + 1 bonus added a Considered no suit and rank are some bonus although same Therefore Likeness Score +2 = 2.6 Thus, the Range of the Likeness Scores is: [0, 1 Number of Cards in Sequences) In this project (Questions 4-7) you will be creating an interactive program in C++ to allow users to play this game by implementing the following features: Q4: caloLikenessScorel) - A function to calculate the likeness between two sequences of equal length Q5: bestLikenesssoore() - A function to calculate the best Likeness Score among all the subsequences in a sequence and a given Golden Sequence Q6: findWinner) - A function to find the winner among 3 players whose sequence has the best Likeness Score with the Golden Sequence 07: Putting it All Together. Write a main(function that is going to call all the three functions created above to make the players play the game You're welcome to write additional helper functions as you need. Write your code and test each function on your VS Code. Then, once finished, you can submit it on Canvas coderunner to make sure it's fully functional. All the functions and the main function should be in one file Sequenceof Cards.cpp Question 4: calcLikenessscore() (8 points) Write a function called callikenessScore) that is going to find the Likeness Score (as described earlier) between two sequences of equal length Function Specifications: 578SJD ECJD Name: cale.ikenacor > Parameters (Please Follow the same Order): Ogl (atring). The First Sequence Seg2 (string) - The Second Sequence Return Value: The Likeness Score-likeness_score (double) The parameters sel and g2 should be of the same length for the function to calculate the Likeness Score.Else the Likeness Score retumed should be - 1. The function should not print anything Examples: Parameters and their expected Likeness Score which the function should return segi seq2 11keness score 87H8CJDSHA 6 87HSCJDHA CAJSK CADESK 3 DADOSJ 1.67 BODASJ BJDKCS D7H284 0 C3HJDK HSDTSBCS The fle should be named as calelikaneasScore.cpp. Once you have tested your code on VS Code, then head over to Coderunner on Carwas and paste only your function in the answer box! Hint: Remember when you write a for loop. you can increment the value of the counter variable by any value and not just 1. Question 5: bestLikenessscore() (8 points) Write a function called bestLikenessScore) that is going to find the best Likeness Score between all the subsequences of a sequence (whose length is greater than or equal to the Golden Sequence) and the Golden Sequence. This function finds the mandmum possible score a player could have Function Specifications: Name: best likenessscore) Parameters (Please Follow the same Order): segl (string) - The Player's Sequence length greater than or equal to Golden Sequence) gold_seg istringi - The Golden Sequence Return Value: Best Likeness Score-best_11keness_score (double) Length of seql should be greater than or equal to gold seg for the function to calculate the Best Likeness Score. If not, return-1. Compare the subsequences from the player's sequence to the Golden Sequence to find the Best Likeness Score among all the sub-sequences Use the previous callikenesscore) function from Question 4 to find the Likeness Score once the subsequence is obtained The function should not print anything Example: Expected output from a Longer Player's Sequence and the Golden Sequence segi seg2 likeness_score 578SJDOHJD9 0 S7IBSJD 9HBCJD9 1.67 H8C6D6 0 SHBSJDBCUDO SH BBCD o 2 2 The function should calculate the Likeness Score between all the sub-sequences and the Golden Sequence and should return only the Best Likeness Score as indicated. In the example above, the last subsequence has the highest score, 2, and therefore 2 should be the retum value. The fle should be named as bestLikenessScore.cpp. Once you have tested your code on vs Code, then head over to coderunner on Canvas and paste only your function in the answer box! Question 6: findWinner () (7 points) Write a function called findkinner) that is going to find the Winner among 3 players and display the winner in the console. The players have the option to pick a maximum of 10 cards and form their sequences. It is not necessary for the players to choose the same number of cards. These sequences are passed into the function as sagl, 392, 3 The length of the Golden Sequence will always be lesser than or equal to the length of the smallest sequence among the 3 players. Function Specifications: Name: Findinner) Parameters (Please Follow the same Order): Ogl (atring. Player 1 Sequence seg (string) - Player 2 Sequence seg (string) - Player 3 Sequence O gold_eq istringi - The Golden Sequence Return Value: No Return value. Output Remember, that in order for a player to win his/her score should be greater than 0. If all three players have a score of then there is no winner and the function should print "Better luck next time everyone!" If all the three players have the same score, then the function should print "Congratulations everyone! You have all won!" o if there are two players with the same best score, the function should print "Congratulations Players . and #! You have won where the represent the winning players. If there is a clear winner, then the function should print "Congratulations Player #! You have woni", where is the 1, 2 or 3. Remember the sequences segl, seq2 and seq3 of the players need not be of the same length, Le., they need not pick the same number of cards. Use the previous bestlikenesescore) function from Questions to find the Best Likeness Score in the entire sequence of the player Examples Caset: All players with a score of 0: player. seq gold me Best Likeness Score 1 0 CAH785CJCK 579 OCA 2 2 D40506 0 3 26 ? 0 EXPECTED OUTPUT Better luck next time everyone! Case2: All players with same Best Likeness Score Player. nego gold seg Best Likeness Score 1 DAR7850 2 D4D5DE 8789DOCA H2SCT 0.33 0.33 0.33 3 EXPECTED OUTPUT Congratulations everyone! You have all went Case3: Two players with same Best Likeness Score: player segi gold meg Beat Likeness Score 1 DAR7850J 0.33 DTD2D3 2 2 3 57D20CAH 1.67 H2DTCTD75805 1.67 OUTPUT Congratulations Players 2 and 3! You have won! Cased: Clear Winner with the Best Likeness Score: Player . sed gold - Best Likeness Score 1 H2DTWTSASICA 3 2 D712SOCAH DTHA 1 3 CJDARTCS 1.67 EXPECTED OUTPUT Congratulations Player 1! You have won! The file should be named as findinner.opp. Once you have tested your code on Vs Code, then head over to coderunner on Canvas and paste only your function in the answer box! Question 7: Putting it all Together using main() (5 points) In this question, you will be writing a natn ) driver function through which you will give the end user the option to choose from the following options: Calculate the Likeness Score between two sequences of equal length Find the Best Likeness Score between two sequences of unequal length . Find the Winner among the sequences of 3 players and the Golden Sequence Ext The menu will run on a loop, continually offering the user four options until they apt to quit. You need to fill in the code for each of the options. Be sure to use the functions you wrote in questions 4-6 Below is an Sample Run of the main program depicting different cases (Text in Bold represents User Input) - Menu - 1: Calculate the Likeness Score between 2 strings of equal length 2: Calculate the best likeness Sore between 2 seguences of possibly different length 3: Find the winner anong sequences of 3 players and a Golden Sequence 41 Exit. Enter your choice 11.1 12 1 Enter 5 L ROOMS Enter 2 DASS Liens Sorel 1. ET 11 Dalolate the core between strange of equal length i allate the heat core Letwa Aqueces of possibly different length 3: Find the winner og mence of 3 players and a Golden 4: Exit Enter your choice 41-4): Enter Set TH Enter HOCEDS ass 3 1: Deleulate the core between 2 strange of qual length. 2: Calculate the best Lee Score between 2 DE Possibly different length. 3: Find the winner mon ences of players and Golden 1. Enter your choice 1-0 > Enter of Mayer! CM1990 ter sange of Player 2 REA SETTE Entet den DO Dettet luck next twee Ion 1: Calculate the albume score between 2 strange of qual length. 21 calculate the best score between 3 dequences of possibly different lorth. 3: Find the winner of players and Golden 4. ter your choice 1-0 Enter Sence of Mayer 1 3 DAX1550 Enter Sence of Player 2 57113DOCA Enter Sance of Player BIECTDT Enter den 010 Congratulations everyone you have all went the string of qual eth 2: Calculate the best Lee Score between 2 O possibly different langth. 3: Find the winner among mences of 3 players and Golden k. Enter your choice 11-01 > Enter Saquence of Mayer 1 request Player 2 TODOC ter of Player OTCTDTSHS Inter Golden ene DTD Congratulations Players and 3! You have won 1: Calculate the less score between 2 strings of equal length. 2. calate the best Lore Letances of Posy dient oth 3: Pad the winnen gences of players and Golden 1. inter Squance of Mayer 1 UTINA Enter Sence of Player DTR2CM Enter Sequence of Mayer CJOCS inter alden DISA Congratulation Player ! You have wont Mer! Choice Li Calculate the Lane Sere between 2 age of qual Choice 2: Cette the line Score between 2 of possibly different langt Choices: Find winter ces of players and Guiden BG chance it. Enter your choice 1-0) 1 Enter Sauce DTSAR maid trout ces of different length 1 calculate the core between 2 string of qual length. 2: Calculate the best Lee Score between 2 ceo possibly different length. Pled the war manquence of a players and a balden Enter your choice 41-4): walid input. Chocolate Sen atto quel enth 2: Calculate the best Lee Score between 2 O possibly different longth 3: Find the winner of players and a Golden 1 enter your choice 11-1) Ext... The file should be remedanceCarde.cpp Once you have your code on V8 Code, then head over to cadere on Canvas and pude the entire program undir Questions 48 and the function om weerbord DECK OF CARDS The standard 52-card deck of French-suited playing cards is the most common pack of playing cards used today. A standard 52-card pack comprises 13 ranks in each of the four French suits: Clubs (*), Diamonds (), Hearts () and Spades (*), with reversible (double-headed) court cards (face cards). Each suit includes an Ace, a King, Queen and Jack, each depicted alongside a symbol of its suit; and numerals or pip cards from the Deuce (Two) to the Ten, with each card depicting that many symbols (pips) of its suit. Example set of 52 playing cards; 13 of each sult: clubs, diamonds, hearts, and spades Jack Queen King Ace 3 9 10 . Clubs A . . Diamonds Hearts Spades . Ref. Standard 52-Card Deck SEQUENCE OF CARDS John, Mike and Suzy head to the Carnival at Zootopia. They come across a stall named "Can You Pick 'em Right?!". The stall owner Mr X greets them and invites them to play his game and tells them that the winner will get a coupon worth $50 to spend in the Carnival. The three friends get excited and decide to play the game. Mr X starts to explain the game to the participants. The ultimate aim of the game is for the players to create a sequence by picking a set of cards which is similar to the sequence picked by the host, i.e., Mr X. He says that every player is free to choose up to a maximum of 10 cards to form their sequence. A sequence is formed by the cards picked by the players. The players select a subsequence of cards from their hand to compare against the golden sequence. The players cannot rearrange the cards, but can select a continuous subset that is the same length as the golden sequence. The game is played with multiple decks of cards. We know that in a deck of cards there are four suits: Spades (S), Hearts (H), Diamonds (D) and Clubs (C). And there are 13 ranks in each suit: Ace, 2-10, Jack, Queen and King. For the purpose of creating the sequence Ace is treated as the character A, Ten as T, Jack as J, Queen as Q and King as K. Formation of Sequences: First, the card's suit is taken and the letter representing that suit is added to the sequence. Next, the card's rank is taken and appended to the sequence. Similarly, the process is repeated for all the cards picked by the player in the order that they pick the cards. Let us assume that John has picked the following cards: Ace of Diamonds, 5 of Hearts, Ten of Spades, Queen of Clubs and the 6 of Hearts in the same order as specified. Therefore the sequence generated by John is as follows: DAHS STCQH6 Each player picks a maximum of 10 cards from which they can create their sequence. Once all the players have picked their cards, Mr X chooses his sequence of cards (without any knowledge of the cards picked by the players), which is going to be the Golden Sequence of cards. Mr. X can choose any number of cards less than or equal to 10. Let us assume that Mr X picks the following cards: Ace of Diamonds, 4 of Hearts, Ten of Spades, 8 of Hearts and 6 of Clubs. So the Golden Sequence is as follows: DAH4 STH8C6 Once the Golden Sequence is found, a Likeness Score between the sequences of the players and the Golden Sequence is found. And finally, the player with the highest Likeness Score is declared the winner Rules for Likeness Score While finding the likeness Score, more priority is given to the Sult of the cards rather than the Rank of the card. Rules include . First, the number of cards under consideration in the player's sequence and the Golden Sequence must be the same. So the player has picked 10 cards, while the Golden Sequence has only 5 cards, then sub-sequences of cards from the original sequence must be obtained. Something like this: Golden Sequence Player's Sub-Sequences To be considered HAD2S3C4850687CHCI HAD2S3C4H5D65CHICT HAD233C4850687cHCT H6CBSJDKS3 HAD233C4A5D6S7C8H9CT HAD23CA85D6S7C89C HAD2S3CA5D6S7C8H9CT . When the two sequences to be considered are available, The suit of the first card in both sequences are taken into account if the suit is the same, then we keep track of those positions where the suit of the card is the same, Next, if and only if the sult of the cards under consideration is the same, we look at the rank of the card. If the rank of the cards are also the same, a bonus point of 1 for every such match) is added in the calculation of the Likeness Score Finally, once all the cards have been compared, the averal Liness Score is calculated as follows: Likeness Score (Mamber of Cards where the suit is sane/ Number of Cards ) Number ( 1 Number of Cards with Same Suit and Sane Rank) Example: Let us look at John's sequence and the Golden Sequence Cards Player Sequenc/Sub Sequence DAH 5 STCQH 6 Not Considered diferent leading to no bonus although and Golden Sequence D AH 4 STH8C6 Not Cordered suit is different leading to no bonus Consideredt + 1 bonus added a Considered no suit and rank are some bonus although same Therefore Likeness Score +2 = 2.6 Thus, the Range of the Likeness Scores is: [0, 1 Number of Cards in Sequences) In this project (Questions 4-7) you will be creating an interactive program in C++ to allow users to play this game by implementing the following features: Q4: caloLikenessScorel) - A function to calculate the likeness between two sequences of equal length Q5: bestLikenesssoore() - A function to calculate the best Likeness Score among all the subsequences in a sequence and a given Golden Sequence Q6: findWinner) - A function to find the winner among 3 players whose sequence has the best Likeness Score with the Golden Sequence 07: Putting it All Together. Write a main(function that is going to call all the three functions created above to make the players play the game You're welcome to write additional helper functions as you need. Write your code and test each function on your VS Code. Then, once finished, you can submit it on Canvas coderunner to make sure it's fully functional. All the functions and the main function should be in one file Sequenceof Cards.cpp Question 4: calcLikenessscore() (8 points) Write a function called callikenessScore) that is going to find the Likeness Score (as described earlier) between two sequences of equal length Function Specifications: 578SJD ECJD Name: cale.ikenacor > Parameters (Please Follow the same Order): Ogl (atring). The First Sequence Seg2 (string) - The Second Sequence Return Value: The Likeness Score-likeness_score (double) The parameters sel and g2 should be of the same length for the function to calculate the Likeness Score.Else the Likeness Score retumed should be - 1. The function should not print anything Examples: Parameters and their expected Likeness Score which the function should return segi seq2 11keness score 87H8CJDSHA 6 87HSCJDHA CAJSK CADESK 3 DADOSJ 1.67 BODASJ BJDKCS D7H284 0 C3HJDK HSDTSBCS The fle should be named as calelikaneasScore.cpp. Once you have tested your code on VS Code, then head over to Coderunner on Carwas and paste only your function in the answer box! Hint: Remember when you write a for loop. you can increment the value of the counter variable by any value and not just 1. Question 5: bestLikenessscore() (8 points) Write a function called bestLikenessScore) that is going to find the best Likeness Score between all the subsequences of a sequence (whose length is greater than or equal to the Golden Sequence) and the Golden Sequence. This function finds the mandmum possible score a player could have Function Specifications: Name: best likenessscore) Parameters (Please Follow the same Order): segl (string) - The Player's Sequence length greater than or equal to Golden Sequence) gold_seg istringi - The Golden Sequence Return Value: Best Likeness Score-best_11keness_score (double) Length of seql should be greater than or equal to gold seg for the function to calculate the Best Likeness Score. If not, return-1. Compare the subsequences from the player's sequence to the Golden Sequence to find the Best Likeness Score among all the sub-sequences Use the previous callikenesscore) function from Question 4 to find the Likeness Score once the subsequence is obtained The function should not print anything Example: Expected output from a Longer Player's Sequence and the Golden Sequence segi seg2 likeness_score 578SJDOHJD9 0 S7IBSJD 9HBCJD9 1.67 H8C6D6 0 SHBSJDBCUDO SH BBCD o 2 2 The function should calculate the Likeness Score between all the sub-sequences and the Golden Sequence and should return only the Best Likeness Score as indicated. In the example above, the last subsequence has the highest score, 2, and therefore 2 should be the retum value. The fle should be named as bestLikenessScore.cpp. Once you have tested your code on vs Code, then head over to coderunner on Canvas and paste only your function in the answer box! Question 6: findWinner () (7 points) Write a function called findkinner) that is going to find the Winner among 3 players and display the winner in the console. The players have the option to pick a maximum of 10 cards and form their sequences. It is not necessary for the players to choose the same number of cards. These sequences are passed into the function as sagl, 392, 3 The length of the Golden Sequence will always be lesser than or equal to the length of the smallest sequence among the 3 players. Function Specifications: Name: Findinner) Parameters (Please Follow the same Order): Ogl (atring. Player 1 Sequence seg (string) - Player 2 Sequence seg (string) - Player 3 Sequence O gold_eq istringi - The Golden Sequence Return Value: No Return value. Output Remember, that in order for a player to win his/her score should be greater than 0. If all three players have a score of then there is no winner and the function should print "Better luck next time everyone!" If all the three players have the same score, then the function should print "Congratulations everyone! You have all won!" o if there are two players with the same best score, the function should print "Congratulations Players . and #! You have won where the represent the winning players. If there is a clear winner, then the function should print "Congratulations Player #! You have woni", where is the 1, 2 or 3. Remember the sequences segl, seq2 and seq3 of the players need not be of the same length, Le., they need not pick the same number of cards. Use the previous bestlikenesescore) function from Questions to find the Best Likeness Score in the entire sequence of the player Examples Caset: All players with a score of 0: player. seq gold me Best Likeness Score 1 0 CAH785CJCK 579 OCA 2 2 D40506 0 3 26 ? 0 EXPECTED OUTPUT Better luck next time everyone! Case2: All players with same Best Likeness Score Player. nego gold seg Best Likeness Score 1 DAR7850 2 D4D5DE 8789DOCA H2SCT 0.33 0.33 0.33 3 EXPECTED OUTPUT Congratulations everyone! You have all went Case3: Two players with same Best Likeness Score: player segi gold meg Beat Likeness Score 1 DAR7850J 0.33 DTD2D3 2 2 3 57D20CAH 1.67 H2DTCTD75805 1.67 OUTPUT Congratulations Players 2 and 3! You have won! Cased: Clear Winner with the Best Likeness Score: Player . sed gold - Best Likeness Score 1 H2DTWTSASICA 3 2 D712SOCAH DTHA 1 3 CJDARTCS 1.67 EXPECTED OUTPUT Congratulations Player 1! You have won! The file should be named as findinner.opp. Once you have tested your code on Vs Code, then head over to coderunner on Canvas and paste only your function in the answer box! Question 7: Putting it all Together using main() (5 points) In this question, you will be writing a natn ) driver function through which you will give the end user the option to choose from the following options: Calculate the Likeness Score between two sequences of equal length Find the Best Likeness Score between two sequences of unequal length . Find the Winner among the sequences of 3 players and the Golden Sequence Ext The menu will run on a loop, continually offering the user four options until they apt to quit. You need to fill in the code for each of the options. Be sure to use the functions you wrote in questions 4-6 Below is an Sample Run of the main program depicting different cases (Text in Bold represents User Input) - Menu - 1: Calculate the Likeness Score between 2 strings of equal length 2: Calculate the best likeness Sore between 2 seguences of possibly different length 3: Find the winner anong sequences of 3 players and a Golden Sequence 41 Exit. Enter your choice 11.1 12 1 Enter 5 L ROOMS Enter 2 DASS Liens Sorel 1. ET 11 Dalolate the core between strange of equal length i allate the heat core Letwa Aqueces of possibly different length 3: Find the winner og mence of 3 players and a Golden 4: Exit Enter your choice 41-4): Enter Set TH Enter HOCEDS ass 3 1: Deleulate the core between 2 strange of qual length. 2: Calculate the best Lee Score between 2 DE Possibly different length. 3: Find the winner mon ences of players and Golden 1. Enter your choice 1-0 > Enter of Mayer! CM1990 ter sange of Player 2 REA SETTE Entet den DO Dettet luck next twee Ion 1: Calculate the albume score between 2 strange of qual length. 21 calculate the best score between 3 dequences of possibly different lorth. 3: Find the winner of players and Golden 4. ter your choice 1-0 Enter Sence of Mayer 1 3 DAX1550 Enter Sence of Player 2 57113DOCA Enter Sance of Player BIECTDT Enter den 010 Congratulations everyone you have all went the string of qual eth 2: Calculate the best Lee Score between 2 O possibly different langth. 3: Find the winner among mences of 3 players and Golden k. Enter your choice 11-01 > Enter Saquence of Mayer 1 request Player 2 TODOC ter of Player OTCTDTSHS Inter Golden ene DTD Congratulations Players and 3! You have won 1: Calculate the less score between 2 strings of equal length. 2. calate the best Lore Letances of Posy dient oth 3: Pad the winnen gences of players and Golden 1. inter Squance of Mayer 1 UTINA Enter Sence of Player DTR2CM Enter Sequence of Mayer CJOCS inter alden DISA Congratulation Player ! You have wont Mer! Choice Li Calculate the Lane Sere between 2 age of qual Choice 2: Cette the line Score between 2 of possibly different langt Choices: Find winter ces of players and Guiden BG chance it. Enter your choice 1-0) 1 Enter Sauce DTSAR maid trout ces of different length 1 calculate the core between 2 string of qual length. 2: Calculate the best Lee Score between 2 ceo possibly different length. Pled the war manquence of a players and a balden Enter your choice 41-4): walid input. Chocolate Sen atto quel enth 2: Calculate the best Lee Score between 2 O possibly different longth 3: Find the winner of players and a Golden 1 enter your choice 11-1) Ext... The file should be remedanceCarde.cpp Once you have your code on V8 Code, then head over to cadere on Canvas and pude the entire program undir Questions 48 and the function om weerbord