Problem 1
Alice and Bob are playing the following game. There is a group of n (non-empty) words (consisting of the 26 lower cases English letters). Alice and Bob take turns forming a word together, which is initially empty. In their turn, the player will add a single letter at the end of the word formed so far, such that the resulting wor(l is a prefix of a sonic word in the group of words. Tite player loses if they cannot make a ¡nove.
If both Alice and Bob play the game optimally (Alice making the first ¡nove), output the name of the player who wins the game.
. Input: Read the Input from the file inpl.txt. The first hue contains a single integer n and the following n lines each contain a string of lower case English letters.
. Constraints: Total number of letters in the group of n words doesn’t not
exceed io.
. Output: \Trite the output to the file outl.txt.
Sample Input 1
ab
Sample Output 1
Alice
Explanation 1
If Alice chooses a then Bob can choose b and Alice loses. But Alice can choose b in
the start and force a win.
Sample Input 2
aa
ba
bbb
Sample Output 2
Bob
Explanation 2
If Alice chooses a, Bob then picks a and wins. If Alice chooses b, Bob would pick a
to win. So Bob has a winning strategy.
CS 340 Milestone One Guidelines and Rubric Overview: For this assignment, you will implement the fundamental operations of create, read, update,
Retail Transaction Programming Project Project Requirements: Develop a program to emulate a purchase transaction at a retail store. This
7COM1028 Secure Systems Programming Referral Coursework: Secure
Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip
CS 340 Final Project Guidelines and Rubric Overview The final project will encompass developing a web service using a software stack and impleme