Both players are given the same string. S. Both players have to make substrings using the letters of the string S. Stuart has to make words starting with consonants. Kevin has to make words starting with vowels. The game ends when both players have made all possible substrings. Scoring A player gets +1 point for each occurrence of the substring in the string S. For Example: String S = BANANA Kevin's vowel beginning word= ANA Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points. For better understanding see the image below: BANANA STUART KEVIN WORDS SCORE WORDS SCORE 2 AN 2 BA ANA NA ANAN BAN ANANA NAN BANA NANA BANAN BANANA TOTAL 12 TOTAL Your task is to determine the winner of the game and their score. Function Description Complete the minion_game in the editor below. minion_game has the following parameters: • sring string the string to analyze Prints string the winner's name and score, separated by a space on one line, or Draw if there is no winner Input Format A single line of input containing the string S. Note: The string S will contain only uppercase letters: [A – 21. Constraints 0< len(8) < 10 Sample Input BANANA Sample Output Stuart 12
Both players are given the same string. S. Both players have to make substrings using the letters of the string S. Stuart has to make words starting with consonants. Kevin has to make words starting with vowels. The game ends when both players have made all possible substrings. Scoring A player gets +1 point for each occurrence of the substring in the string S. For Example: String S = BANANA Kevin's vowel beginning word= ANA Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points. For better understanding see the image below: BANANA STUART KEVIN WORDS SCORE WORDS SCORE 2 AN 2 BA ANA NA ANAN BAN ANANA NAN BANA NANA BANAN BANANA TOTAL 12 TOTAL Your task is to determine the winner of the game and their score. Function Description Complete the minion_game in the editor below. minion_game has the following parameters: • sring string the string to analyze Prints string the winner's name and score, separated by a space on one line, or Draw if there is no winner Input Format A single line of input containing the string S. Note: The string S will contain only uppercase letters: [A – 21. Constraints 0< len(8) < 10 Sample Input BANANA Sample Output Stuart 12
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Both players are given the same string. S.
Both players have to make substrings using the letters of the string S.
Stuart has to make words starting with consonants.
Kevin has to make words starting with vowels.
The game ends when both players have made all possible substrings.
Scoring
A player gets +1 point for each occurrence of the substring in the string S.
For Example:
String S = BANANA
Kevin's vowel beginning word = ANA
Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points.
For better understanding, see the image below:
BANANA
STUART
KEVIN
WORDS
SCORE
WORDS
SCORE
2.
AN
2
BA
ANA
2
NA
ANAN
BAN
ANANA
NAN
BANA
NANA
BANAN
BANANA
ТОTAL
12
TOTAL
Your task is to determine the winner of the game and their score.
Function Description
Complete the minion game in the editor below.
minion_game has the following parameters:
• sring string the string to analyze
Prints
• tring: the winner's name and score, separated by a space on one line, or Dr aw if there is no winner
Input Format
A single line of input containing the string S.
Note: The string S will contain only uppercase letters: [A – Z].
Constraints
O len(S) < 10
Sample Input
BANANA
Sample Output
Stuart 12](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F72cf69a9-a96b-42a0-8695-1771b517b89b%2Fba9690bf-b91b-4134-bc26-7c13c2ff5b3f%2Fei0ejvg_processed.png&w=3840&q=75)
Transcribed Image Text:Both players are given the same string. S.
Both players have to make substrings using the letters of the string S.
Stuart has to make words starting with consonants.
Kevin has to make words starting with vowels.
The game ends when both players have made all possible substrings.
Scoring
A player gets +1 point for each occurrence of the substring in the string S.
For Example:
String S = BANANA
Kevin's vowel beginning word = ANA
Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points.
For better understanding, see the image below:
BANANA
STUART
KEVIN
WORDS
SCORE
WORDS
SCORE
2.
AN
2
BA
ANA
2
NA
ANAN
BAN
ANANA
NAN
BANA
NANA
BANAN
BANANA
ТОTAL
12
TOTAL
Your task is to determine the winner of the game and their score.
Function Description
Complete the minion game in the editor below.
minion_game has the following parameters:
• sring string the string to analyze
Prints
• tring: the winner's name and score, separated by a space on one line, or Dr aw if there is no winner
Input Format
A single line of input containing the string S.
Note: The string S will contain only uppercase letters: [A – Z].
Constraints
O len(S) < 10
Sample Input
BANANA
Sample Output
Stuart 12
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY