Provided txt files monster1 and monster2

Please answer in Python. Thanks

Purpose: To practice applying a Queue ADT Degree of Difficulty: Easy Restrictions: This question is homework assigned to students and will be graded. This question shall not be distributed to any person except by the instructors of CMPT 145. Solutions will be made available to students registered in CMPT 145 after the due date. There is no educational or pedagogical reason for tutors or experts outside the CMPT 145 instructional team to provide solutions to this question to a student registered in the course. Students who solicit such solutions are committing an act of Academic Misconduct, according to the University of Saskatchewan Policy on Academic Misconduct. Space monsters are attacking the Earth, and a giant monster slug-a-thon is imminent. Only Godzilla and Mothra can protect the Earth from this invasion! Problem Description In this problem, monsters are arriving to a battlefield one-at-a-time. The input for this problem will consist of of a text file indicating the order in which the monsters arrive. Each line of the file consists of a single monster's name. It might look like this: Gezora Moguera Godzilla Mothra In general, the monster names could be anything, but two names are of special significance: Godzilla and Mothra. All other names are for space monsters. A name could occur more than once, and the names Godzilla and Mothra in particular will very likely occur many times. To simulate the battle, your program should keep track of the order in which the space monsters arrive. Whenever either Godzilla or Mothra arrives, they will defeat whichever space monster is currently first in line. If Godzilla or Mothra arrive when there are no space monsters waiting. nothing happens. Two end results of this battle are possible: - The space monsters lose if all of the space monsters are defeated. In this case, your program should print out the names of all of the space monsters that were defeated by each of Godzilla and Mothra. - The space monsters win. This happens if there is at least one space monster who is not defeated by Godzilla or Mothra. In this case, the program should print out the name of the space monster who is currently first in line. Implementation This is a problem where a Queue data structure can be very useful. A simple implementation of the Queue ADT is provided on the course website. Your program must make effective use of the Queue ADT as part of your approach to solving this problem. Sample Output Some sample input files are provided on the course website. For monsters1.txt. your output might look like this: The space monsters were beaten! Godzilla defeated: Moguera Mothra defeated: Gezora Varan Alternatively, for monsters2.txt, your output might look like this: Oh no! The space monsters won thanks to Mechagodzilla We may test your program win inputs beyond just those given here. What to Hand In A file named a5q2.py with your solution to this problem. It must import the Queue ADT. It is NOT required to hand in the provided Queue file. Be sure to include your name. NSID. student number, course number and instructor name at the top of all documents. Evaluation - 4 marks: The overall outcome is correctly computed (at most 1 mark if a Queue is not used effectively) - 3 marks: The list of defeated monsters is correctly computed for both Godzilla and Mothra - 1 mark: The correct space monster is reported when the space monsters win Gezora Moguera Mothra Godzilla Varan Mothra Hedorah Godzilla Baragon Mothra Mechagodzilla