Two players find themselves in a legal battle over a patent. The patent is worth 20 for each player, so the winner would receive 20 and the loser 0. Given the norms of the country they are in, it is common to bribe the judge of a case. Each player can secretly oer a bribe of 0, 9 or 20, and the one whose bribe is the largest is awarded the patent. If both choose not to bribe, or if the bribes are the same amount, then each has an equal chance of being awarded the patent. (If a player decides to bribe then the judge pockets it regardless of who gets the patent).

(a) Derive the game matrix.

(b) Is the game dominance solvable? If so, findnd the strategy prole surviving IDSDS.

(c) Now consider the case in which the allowed bribe amounts are instead 0, 9 and 15. Is the game dominance solvable? Find the best responses of each player to each of the pure strategies of the opponent.

(Can you answer my question by explaining, I mean that step by step. I don't want a short answer. Be sure to I like it if you write step by step

For Design and Analysis of the Algorithme lecture)

Peak Finding

Implement the 2-D peak finder mentioned and explain the asymptotic complexity of the algorithm.

Write a java program to read a string from the keyboard, and count number of digits, letters, and whitespaces on the entered string. You should name this project as Lab5B.

• This program asks user to enter string which contains following characters: letters or digits, or whitespaces. The length of the string should be more than 8. You should use nextLine() method to read string from keyboard.

• You need to extract each character, and check whether the character is a letter or digit or whitespace.

• You can access character at a specific index using charAt() method. Once you have extracted the character, you can test the extracted character using character test methods.

• You can look at google/web search to check the methods (isDigit, isLetter, and isSpaceChar) available to test a character. Use the syntax properly in your code.

• Once you found a match, simply increase the value of the counter by 1. You need 3

  separate counters to count letters, digits, and spaces.

• In this program, you do not need to worry about uppercase or lowercase letter.

     Sample Output 1
  

     Enter the string: EEEEEEE RRR LLLLLL UUUUUUUUUU
     Number of spaces: 3
     Number of letters: 26
     Number of digits: 0
  

# Finds and returns only the even elements in the list u.
# find_evens([1, 2, 3, 4] returns [2, 4]
# find_evens([1, 2, 3, 4, 5, 6, 7, 8, 9, 10] returns [2, 4, 6, 8, 10]
#
u = [1, 2, 3, 4] 
v = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

def find_evens(u):
    return None  # Replace this with your implementation

print('Testing find_evens')
print(' find_evens(u): ' + str(find_evens(u)))
print(' find_evens(v): ' + str(find_evens(v)))
print()

Making code using recursion function

In Python

explain industrial wastewater treatment,strength reduction,suggested treatment methods and with diagram.(50marks)

Need own answer and no internet answers r else i il downvote nd report to chegg.Even a single is wrong i il downvote.its 50marks question so no short answer minimum 10page answer required and own answer r else i il downvote.

Note:Minimum 10page answer and no plagarism r else i il downvote and report to chegg.Minimum 10 to 15page answer required r else dnt attempt.strictly no internet answer n no plagarism.

its 50marks question so i il stricly review nd report

Paula and Danny want to plant evergreen trees along the back side of their yard. They do not want to have an excessive number of trees. Write a program that prompts the user to input the following:

The length of the yard.

The radius of a fully grown tree.

The required space between fully grown trees.

The program outputs the number of trees that can be planted in the yard and the total space that will be occupied by the fully grown trees.

1.What are the THREE (3) types of CSS?

a) Internal, External and Online Style Sheets

b) Embedded, Outsider and Inline Style Sheets

c) Embedded, Linking and Inline Style Sheets

2. The width, src and border are examples of an ______. *

a) entity

b) element

c) attribute

d) operation

d) Internal, External and Inline Style Sheets

3. Which of the following codes best represents inserting image from folder named images?

a) <p>Image:</p> <img src="/chrome/images.gif" alt="Google Chrome" width="33" height="32" />

b) <p>Image:</p><img src="file://images/chrome.gif" alt="Google Chrome" width="33" height="32" />

c) <p>Image:</p><img src="/images/chrome.gif" alt="Google Chrome" width="33" height="32" />

d) <p>Image:</p><img src="folder: images image file name: chrome.gif" alt="Google Chrome" width="33" height="32" />

4.Which of the following is the CORRECT HTML tag to start JavaScript?

a) <script>

b) <js>

c) <javascript>

d) <scripting>

5. How can you add a comment in JavaScript? *

a) <!--This is a comment-->

b) //This is a comment

c) "This is a comment"

d) <--! This is a comment -->

6. Select the correct HTML statement in referring to an external style sheet.

a) <link rel="stylesheet" type="text/css" href="mystyle.css">

b) <stylesheet>mystyle.css</stylesheet>

c) <style src="mystyle.css">

d) <link rel=”style" type="text/css" href="mystyle.css">

Make pesodocode of this code.

void loadData()
{
char line[MAX_LENGTH];
const char * delimiter = ",\n";
FILE * fp;
fp = fopen("patients.txt", "r");
char c;
if (fp == NULL)
{
printf("file not found");
return;
}
while (fp != NULL)
{
if (fgets(line, MAX_LENGTH - 1, fp) == NULL)
break;
if (line[1] == '\0')
break;
patients[patientCount].id = atoi(strtok(line, delimiter));
strcpy(patients[patientCount].name, strtok(NULL, delimiter));
patients[patientCount].age = atoi(strtok(NULL, delimiter));
patients[patientCount].annualClaim = strtok(NULL, delimiter);
patients[patientCount].plan = atoi(strtok(NULL, delimiter));
strcpy(patients[patientCount].contactNum, strtok(NULL, delimiter));
strcpy(patients[patientCount].address, strtok(NULL, delimiter));
strcpy(line, "\0");
patientCount++;
}
fclose(fp);
fp = fopen("claims.txt", "r");
int claimCount = 0;
while (fp != NULL)
{
if (fgets(line, MAX_LENGTH - 1, fp) == NULL)
break;
if (line == "\n")
break;
claims[claimCount].id = atoi(strtok(line, delimiter));
claims[claimCount].claimedYear = atoi(strtok(NULL, delimiter));
claims[claimCount].amountClaimed = atoi(strtok(NULL, delimiter));
claims[claimCount].remaininigAmount = atoi(strtok(NULL, delimiter));
strcpy(line, "\0");
claimCount++;
}
fclose(fp);
}
int menu()
int ch;
do {
system("cls");
printf("Select one of the below option to continue\n");
printf("1-Insurence Plan Subscription\n");
printf("2-Claim Processing\n");
printf("3-Accounts Information\n");
printf("4-Searching Functionalities\n");
printf("5-Exit\n");
scanf("%d", & ch);
} while (ch > 5 || ch < 1);
return ch;
}
int main()
{
int ch;
loadData();
do {
ch = menu();
if (ch == 1)
subscribe();
else if (ch == 2)
claimProcess();
else if (ch == 3)
accountInfo();
else if (ch == 4)
searchingFunctionalities();
else
break;
} while (ch != 5);
system("pause");
return 0;
}

NoSQL databases can store relationship data—they just store it differently than relational databases do. How would you describe the differences between a relational database and a NoSQL database? What do you see as the business advantages that a NoSQL database has over a relational database?

Describe an aspect of your everyday life that has been touched by Big Data and/or Business Intelligence Systems. Be sure to include your thoughts on the advantages or challenges you feel Big Data poses for modern data driven businesses.

Question 1: Car Dealership Scenario. Complete parts A – D based on the database specifications listed below.

Database Specification

• Car Dealerships have a unique business id number, dealership name, city, state, and a unique website URL. The business id is a number in the range from 1000-9999.
• Salespersons have a first name, last name, age, gender, and a unique employee id number. The employee number is in the range 100-999.
• Customers have a first name, last name, city, state, gender, age, and a unique taxpayer id number. The taxpayer id number is 9 digits.
• Cars have a make, model, year, suggested price, and a unique vehicle id number. A car can have (possibly multiple) colors that should be modeled as an attribute. Note: the make of a car is the manufacturer (e.g., Ford, Honda, BMW) and the model is the name of the model (e.g. Civic, Accord, CRX).
• Salespersons work for dealerships. In order to be in the database, a salesperson must work for a dealership. However, a dealership may exist in the database without any salespersons. Dealerships have many salespersons who work for them, and a salesperson may work for many different dealerships. The database should record the start date when a salesperson began working for a dealership.
• Dealerships own cars. A dealership may own many cars, or they may be completely out of inventory and own zero cars. A car can only be owned by one dealership, and must be owned by a dealership in order to be in the database. The database should record the date that the dealership acquired the car and the price that the dealership paid for the car.
• Salespersons sell cars to customers. Even if a salesperson has not sold any cars to customers they should still be stored in the database. However, the database should only store information about customers who have purchased a car from a salesperson. Information about cars owned by dealerships should be stored in the database regardless of whether they have been sold or not. A salesperson may sell a particular car to only one customer. Similarly, a customer may purchase a particular car from only one salesperson. However, a customer may purchase more than one car from the same salesperson. When a salesperson sells a car to a customer, the sales price and date should be recorded in the database.

Parts A - D

1. Based on the database specification given above, draw an ER diagram for the database. Include entities, attributes, relationships, cardinality, and participation constraints. The ER diagram should accurately reflect the specifications.  Clearly state any assumptions.

2. Map your ER diagram to relations. Make sure to represent the relations, attributes, primary keys, and foreign keys.

3. Implement your database. Based on your ER and relation diagrams, create tables, specify primary and foreign keys, and include any other necessary integrity constraints such as checks. Turn in a list of the SQL DDL commands (e.g., create table commands) that you used to create your database.

4. Populate your database with data. You may do this either by writing SQL insert statements to load data, or by using the data entry or import features of MySQL Workbench. You need to create enough and appropriate data to illustrate that your database works for the queries below. At a minimum, load at least three records for each table. However, you may need to load more records to illustrate that particular queries work correctly.

5. Write and run SQL queries in MySQL Workbench for each of the queries listed below using your database with the data loaded. In your report, for each query, restate the query in English, then list the SQL query you wrote for it, and finally, list the output from the database in response to the query.

Queries: Write and run SQL queries for the following questions. Use the minimum number of tables required for each query.

1. List the first and last names of customers over 40 years old who purchased a Ford car.
2. List the first and last names of salespersons who have NEVER sold a Ford car.
3. List the total value (suggested price) of all cars owned by the dealership named ‘SILS Car Deals’.
4. Find the average sales price (actual sales price, not suggested price) of a 2008 Honda Civic.
5. List the dealership name and the total number of cars that each dealership owns.
6. List the average age of customers who have purchased a car from salesperson ‘Homer Simpson’.
7. List the last name, employee id number, and the overall number of cars sold by each salesperson who has sold at least one Honda Civic.
8. List the names of salespersons who have worked for all the car dealerships.

For each of bubble sort and insertion sort, state briefly

(i) what the best case input is,

(ii) what the best case running time complexity (in big O) is for an input file of N elements is and

(iii) why the best case running time complexity is like that

Below is my c program code you have to change all the functions names variables name , every thing so it wont look same but runs the same and make sure you run the program and share the output so i get to know that the program is running thank you.

#define _CRT_SECURE_NO_DEPRECATE
#include
#include
#include
#include
#include
struct patient {
int id;
int age;
bool annualClaim;
int plan;
char name[30];
char contactNum[15];
char address[50];
};
#define MAX_LENGTH 500
struct patient patients[100];
int patientCount = 0;
struct claim {
int id;
int claimedYear;
int amountClaimed;
int remaininigAmount;
};
struct claim claims[100];
void subscribe()
{
system("cls");
patients[patientCount].id = patientCount + 1;
printf("Enter age: ");
scanf("%d", & patients[patientCount].age);
printf("\n\n%-25sHealth Insurence Plan\n\n", " ");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", " ", "Plan 120(RM)", "Plan 150(RM)", "Plan 200(RM)");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20d|%-20d|%-20d|\n", "Monthly Premium", 120, 150, 200);
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20d|%-20d|%-20d|\n", "Annual Claim Limit", 120000, 150000, 200000);
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20d|%-20d|%-20d|\n", "Lifetime Claim Limit", 600000, 750000, 1000000);
printf("-----------------------------------------------------------------------------------------------\n");
printf("\n\n%-25sAge Group and Health Insurence Plan\n\n", " ");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-25s%-30s\n", "Types of Claim", " ", "Eligibility Amount");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", " ", "Plan 120(RM)", "Plan 150(RM)", "Plan 200(RM)");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", "Room Charges", "120/day", "150/day", "200/day");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", "Intensive Care Unit", "250/day", "400/day", "700/day");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", "Hospital Supplies and Services", " ", " ", " ");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-60s|\n", "Surgical Fees", "As charged Sbject to approval by ZeeMediLife");
printf("-----------------------------------------------------------------------------------------------\n");
printf("|%-30s|%-20s|%-20s|%-20s|\n", "Other Fees", " ", " ", " ");
printf("-----------------------------------------------------------------------------------------------\n\n");
int ch;
do {
printf("Select a Claim Limit Type\n1-Annual Claim Limit 2-Lifetime Claim Limit: ");
scanf("%d", & ch);
} while (ch < 1 || ch > 2);
if (ch == 1)
patients[patientCount].annualClaim = true;
else
patients[patientCount].annualClaim = false;
do {
printf("Select a plan\n1-Plan120 2-Plan150 3-Plan200: ");
scanf("%d", & ch);
} while (ch < 1 || ch > 3);
patients[patientCount].plan = ch;
printf("Enter Name: ");
scanf("%s", & patients[patientCount].name);
printf("Contact Number: ");
scanf("%s", & patients[patientCount].contactNum);
printf("Enter Address: ");
scanf("%s", & patients[patientCount].address);
FILE * fp;
fp = fopen("patients.txt", "a");
fprintf(fp, "%d,%s,%d,%d,%d,%s,%s\n", patients[patientCount].id, patients[patientCount].name, patients[patientCount].age, patients[patientCount].annualClaim, patients[patientCount].plan, patients[patientCount].contactNum, patients[patientCount].address);
fclose(fp);
time_t s;
struct tm * currentTime;
s = time(NULL);
currentTime = localtime( & s);
claims[patientCount].id = patients[patientCount].id;
claims[patientCount].amountClaimed = 0;
claims[patientCount].claimedYear = currentTime -> tm_hour + 1900;
if (patients[patientCount].annualClaim == true)
{
if (patients[patientCount].plan == 1)
claims[patientCount].remaininigAmount = 120000;
else if (patients[patientCount].plan == 2)
claims[patientCount].remaininigAmount = 150000;
else
claims[patientCount].remaininigAmount = 200000;
} else
{
if (patients[patientCount].plan == 1)
claims[patientCount].remaininigAmount = 600000;
else if (patients[patientCount].plan == 2)
claims[patientCount].remaininigAmount = 750000;
else
claims[patientCount].remaininigAmount = 1000000;
}
patientCount++;
fp = fopen("claims.txt", "a");
if (fp == NULL)
printf("File Dont exist");
fprintf(fp, "%d,%d,%d,%d\n", claims[patientCount].id, claims[patientCount].claimedYear, claims[patientCount].amountClaimed, claims[patientCount].remaininigAmount);
fclose(fp);
system("pause");
}
void claimProcess()
{
int id;
bool found = false;
system("cls");
printf("Enter patient ID for which you want to claim insurrence: ");
scanf("%d", & id);
int i;
for (i = 0; i < patientCount; i++)
{
if (patients[i].id == id)
{
found = true;
break;
}
}
if (found == false)
{
printf("subscriber not found\n");
return;
}
int numOfDaysHospitalized, suppliesCost, surgicalFee, otherCharges;
bool ICU;
printf("How many days were you haspitalized: ");
scanf("%d", & numOfDaysHospitalized);
int ICUFlag;
do {
printf("Select A Ward Type\n1-Normal Ward 2-ICU: ");
scanf("%d", & ICUFlag);
} while (ICUFlag < 1 || ICUFlag > 2);
if (ICUFlag == 2)
ICU = true;
else
ICU = false;
printf("Enter Cost of Supplies and Services: ");
scanf("%d", & suppliesCost);
printf("Enter Surgical Fees: ");
scanf("%d", & surgicalFee);
printf("Enter Other Charges: ");
scanf("%d", & otherCharges);
int ICUCharges = 0;
if (ICU == true)
{
if (patients[i].plan == 1)
ICUCharges = numOfDaysHospitalized * 120;
else if (patients[i].plan == 2)
ICUCharges = numOfDaysHospitalized * 150;
else
ICUCharges = numOfDaysHospitalized * 200;
} else
{
if (patients[i].plan == 1)
ICUCharges = numOfDaysHospitalized * 250;
else if (patients[i].plan == 2)
ICUCharges = numOfDaysHospitalized * 400;
else
ICUCharges = numOfDaysHospitalized * 700;
}
int totalClaimAmount = numOfDaysHospitalized + suppliesCost + surgicalFee + otherCharges + ICUCharges;
if (patients[i].annualClaim == true)
{
if (patients[i].age > 60)
{
printf("The subscriber age has exceeded the limit(60 Year), Not Eligible");
return;
}
}
int j;
for (j = 0; j < patientCount; j++)
{
if (claims[j].id == patients[i].id)
break;
}
int amountToBeBorne = 0;
if (totalClaimAmount <= claims[j].remaininigAmount)
{
claims[j].amountClaimed += totalClaimAmount;
claims[j].remaininigAmount -= totalClaimAmount;
} else
{
amountToBeBorne = totalClaimAmount - claims[j].remaininigAmount;
claims[j].amountClaimed += (totalClaimAmount - amountToBeBorne);
claims[j].remaininigAmount = 0;
printf("\n\nThe amount that can be claimed is less then the claim by subscriber. %d RM should be given by subscriber themselves\n", amountToBeBorne);
}
FILE * fp;
fp = fopen("claims.txt", "w");
for (int i = 0; i < patientCount; i++)
fprintf(fp, "%d,%d,%d,%d\n", claims[i].id, claims[i].claimedYear, claims[i].amountClaimed, claims[i].remaininigAmount);
fclose(fp);
printf("Subscriber ID: %d\nSubscriber Name: %s\nSubscriber Claimed Year: %d\nSubscriber amount Claimed: %d\nSubscriber Remaining Claimed: %d\n", claims[j].id, patients[i].name, claims[j].claimedYear, claims[j].amountClaimed, claims[j].remaininigAmount);
system("pause");
}
void accountInfo()
{
system("cls");
int ch;
printf("1-Total Amount Claimed by LifeTime Claim Limit subscriber\n");
printf("2-Total number of Annual Claim Limit who have exhausted all their eligible amount\n");
scanf("%d", & ch);
if (ch == 1)
{
int totalAmountClaimedByLifeTimeSubs = 0;
for (int i = 0; i < patientCount; i++)
{
if (patients[i].annualClaim == false)
{
for (int j = 0; j < patientCount; j++)
{
if (claims[j].id == patients[i].id)
{
totalAmountClaimedByLifeTimeSubs += claims[j].amountClaimed;
}
}
}
}
printf("\nTotal amount Claimed By LifeTime Subscribers is: %d\n", totalAmountClaimedByLifeTimeSubs);
} else
{
int count = 0;
for (int i = 0; i < patientCount; i++)
{
if (claims[i].remaininigAmount <= 0 && patients[i].annualClaim == true)
count++;
}
printf("Total number of Annual Claim Limit Subcriber who have exhausted all their amount are: %d\n", count);
}
system("pause");
}
void searchingFunctionalities()
{
system("cls");
int ch;
printf("1-Search by ID\n2-Search by age\n");
scanf("%d", & ch);
if (ch == 1)
{
int id;
printf("Enter patient ID for which you want Search: ");
scanf("%d", & id);
int i;
for (i = 0; i < patientCount; i++)
{
if (patients[i].id == id)
{
printf("\nSubscriber Name: %s\nSubscriber Age: %d\nSubscriber Contact: %s\nSubscriber Address: %s\n", patients[i].name, patients[i].age, patients[i].contactNum, patients[i].address);
break;
}
}
printf("Subscriber Not Found");
} else
{
int age;
printf("Enter age for which you want Search: ");
scanf("%d", & age);
for (int i = 0; i < patientCount; i++)
{
if (patients[i].age == age)
{
printf("\nSubscriber Name: %s\nSubscriber ID: %d\nSubscriber Contact: %s\nSubscriber Address: %s\n", patients[i].name, patients[i].id, patients[i].contactNum, patients[i].address);
}
}
}
system("pause");
}
void loadData()
{
char line[MAX_LENGTH];
const char * delimiter = ",\n";
FILE * fp;
fp = fopen("patients.txt", "r");
char c;
if (fp == NULL)
{
printf("file not found");
return;
}
while (fp != NULL)
{
if (fgets(line, MAX_LENGTH - 1, fp) == NULL)
break;
if (line[1] == '\0')
break;
patients[patientCount].id = atoi(strtok(line, delimiter));
strcpy(patients[patientCount].name, strtok(NULL, delimiter));
patients[patientCount].age = atoi(strtok(NULL, delimiter));
patients[patientCount].annualClaim = strtok(NULL, delimiter);
patients[patientCount].plan = atoi(strtok(NULL, delimiter));
strcpy(patients[patientCount].contactNum, strtok(NULL, delimiter));
strcpy(patients[patientCount].address, strtok(NULL, delimiter));
strcpy(line, "\0");
patientCount++;
}
fclose(fp);
fp = fopen("claims.txt", "r");
int claimCount = 0;
while (fp != NULL)
{
if (fgets(line, MAX_LENGTH - 1, fp) == NULL)
break;
if (line == "\n")
break;
claims[claimCount].id = atoi(strtok(line, delimiter));
claims[claimCount].claimedYear = atoi(strtok(NULL, delimiter));
claims[claimCount].amountClaimed = atoi(strtok(NULL, delimiter));
claims[claimCount].remaininigAmount = atoi(strtok(NULL, delimiter));
strcpy(line, "\0");
claimCount++;
}
fclose(fp);
}
int menu()
int ch;
do {
system("cls");
printf("Select one of the below option to continue\n");
printf("1-Insurence Plan Subscription\n");
printf("2-Claim Processing\n");
printf("3-Accounts Information\n");
printf("4-Searching Functionalities\n");
printf("5-Exit\n");
scanf("%d", & ch);
} while (ch > 5 || ch < 1);
return ch;
}
int main()
{
int ch;
loadData();
do {
ch = menu();
if (ch == 1)
subscribe();
else if (ch == 2)
claimProcess();
else if (ch == 3)
accountInfo();
else if (ch == 4)
searchingFunctionalities();
else
break;
} while (ch != 5);
system("pause");
return 0;
}

Rock-Paper-Scissors

Implement Rock-Paper-Scissors such that the user can play the computer in a best-of series! The user inputs the number of rounds which should be positive and odd. This is a free form assignment but structure your code similar to the test cases provided. USING MATLAB ONLY!!!

Program Inputs
• How many rounds would you like to play (odd rounds only)?: XXX

– XXX should be positive and odd. Restart the game if the input is not positive or odd.

Program Outputs
• XXX wins this round

– Replace XXX with either User or Computer depending on who wins the round • Game Over!

– After the Game is over display the times User and Computer won after the total number of rounds. Finally display who wins the entire game.

Sample Outputs:

Test Case 1:

Welcome to Rock-Paper-Scissors! Play if you dare!
How many rounds would you like to play (odd rounds only)? 3
You choose to do best out of 3 rounds
*********************************************************
Round 1
*********************************************************
Rock     (0)...
Paper    (1)...
Scissors (2)...
Shoot:    1
The computer chooses Rock and you picked Paper
User wins this round!
*********************************************************

*********************************************************
Round 2
*********************************************************
Rock     (0)...

Paper    (1)...
Scissors (2)...
Shoot:    2
The computer chooses Rock and you picked Scissors
Computer wins this round!
*********************************************************

*********************************************************
Round 3
*********************************************************
Rock     (0)...

Paper    (1)...
Scissors (2)...
Shoot:    1
The computer chooses Scissors and you picked Paper
Computer wins this round!
*********************************************************

*********************************************************
Game over!
User won 1 out of 3 rounds
Computer won 2 out of 3 rounds

Computer wins! Did you expect anything else?
*********************************************************

Test Case 2:

Welcome to Rock-Paper-Scissors! Play if you dare!
How many rounds would you like to play (odd rounds only)? 3
You choose to do best out of 3 rounds
*********************************************************
Round 1
*********************************************************
Rock     (0)...
Paper    (1)...
Scissors (2)...
Shoot:    5
How dare you cheat at rock paper scissors!
You lose this round! You muggle!
*********************************************************

*********************************************************
Round 2
*********************************************************
Rock     (0)...

Paper    (1)...
Scissors (2)...
Shoot:    7
How dare you cheat at rock paper scissors!
You lose this round! You muggle!
*********************************************************

*********************************************************
Game over!
User won 0 out of 3 rounds
Computer won 2 out of 3 rounds

Computer wins! Did you expect anything else?
*********************************************************

Test Case 3:

Welcome to Rock-Paper-Scissors! Play if you dare!
How many rounds would you like to play (odd rounds only)? 1
You choose to do best out of 1 rounds
*********************************************************
Round 1
*********************************************************
Rock     (0)...
Paper    (1)...
Scissors (2)...
Shoot:    5
How dare you cheat at rock paper scissors!

You lose this round! You muggle!
*********************************************************

*********************************************************
Game over!
User won 0 out of 1 rounds
Computer won 1 out of 1 rounds

Computer wins! Did you expect anything else?
*********************************************************

Test Case 4:

Welcome to Rock-Paper-Scissors! Play if you dare!
How many rounds would you like to play (odd rounds only)? 2
2 is not a valid number of rounds... Try again!
*********************************************************

How many rounds would you like to play (odd rounds only)? 1
You choose to do best out of 1 rounds
*********************************************************
Round 1
*********************************************************
Rock     (0)...

Paper    (1)...
Scissors (2)...
Shoot:    1
The computer chooses Paper and you picked Paper
This round is a tie! Replaying this round...
*********************************************************

*********************************************************
Round 1
*********************************************************
Rock     (0)...

Paper    (1)...
Scissors (2)...
Shoot:    1
The computer chooses Scissors and you picked Paper
Computer wins this round!
*********************************************************

*********************************************************
Game over!
User won 0 out of 1 rounds
Computer won 1 out of 1 rounds

Computer wins! Did you expect anything else?
*********************************************************