Abigail and Benson are playing Rock, Paper, Scissors. Each game is represented by an array of length 2, where the first element represents what Abigail played and the second element represents what Benson played. Given a sequence of games, determine who wins the most number of matches. If they tie, output "Tie". • R stands for Rock • P stands for Paper • S stands for Scissors Examples calculateScore ([["R", "P"], ["R", "S"], ["S", "P"]]) // Benson wins the first game (Paper beats Rock). // Abigail wins the second game (Rock beats Scissors). // Abigail wins the third game (Scissors beats Paper). // Abigail wins 2/3. - "Abigail" calculateScore([["R", "R"], ["S", "S"]]) → "Tie" calculateScore ([["S", "R"], ["R", "S"], ["R", "R"]]) → "Tie"

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Answer the following question in Java Script

Abigail and Benson are playing Rock, Paper, Scissors.
Each game is represented by an array of length 2, where the first element represents what
Abigail played and the second element represents what Benson played.
Given a sequence of games, determine who wins the most number of matches. If they tie,
output "Tie".
• R stands for Rock
• P stands for Paper
• S stands for Scissors
Examples
calculateScore([["R", "P"], ["R", "S"], ["S", "P"]])
// Benson wins the first game (Paper beats Rock).
// Abigail wins the second game (Rock beats Scissors).
// Abigail wins the third game (Scissors beats Paper).
// Abigail wins 2/3.
-> "Abigail"
calculateScore([["R", "R"], ["S", "5"]]) → "Tie"
calculateScore ([["S", "R"], ["R", "S"], ["R", "R"]])
-> "Tie"
Transcribed Image Text:Abigail and Benson are playing Rock, Paper, Scissors. Each game is represented by an array of length 2, where the first element represents what Abigail played and the second element represents what Benson played. Given a sequence of games, determine who wins the most number of matches. If they tie, output "Tie". • R stands for Rock • P stands for Paper • S stands for Scissors Examples calculateScore([["R", "P"], ["R", "S"], ["S", "P"]]) // Benson wins the first game (Paper beats Rock). // Abigail wins the second game (Rock beats Scissors). // Abigail wins the third game (Scissors beats Paper). // Abigail wins 2/3. -> "Abigail" calculateScore([["R", "R"], ["S", "5"]]) → "Tie" calculateScore ([["S", "R"], ["R", "S"], ["R", "R"]]) -> "Tie"
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education