![This is it, the big night! Everything comes together here. Variables: - TrickOrTreater[] cryptKickerFive - array of length 5 - TrickOrTreater[] ghoulGang - array of length 5 Constructors: - A constructor that takes in arrays for cryptKickerFive and ghoulGang (in this order). - You may assume that each input array is not null, and that neither array has null entries. Further, you may assume that each input array is of the expected length. You may shallow copy these arrays. Note: Even though this assignment guarantees each team will have five trick-or-treaters, do not hardcode the literal value 5 throughout this class. Write your code so that it would accommodate any pair of positive length arrays that share a length. Methods: - toString: To get a basic idea for the matchup, format a String representing HalloweenNight to this specification (no leading nor trailing whitespace, no angle brackets, no quotation marks, a single space following each colon and comma, and a single space preceding and following "versus"): versus ghoulGang: , , , , " - Use the String representations defined for each trick-or-treater. - Note: CKF represents the cryptKickerFive and GG represents the ghoulGang. The digit following the initials represents the index in the corresponding array. - Note: It is acceptable to hardcode your format string to anticipate five members on each team for this method. - compareTeams: Trick-or-treaters in each group could be off to a head start. Minding that, this method establishes rough criteria for which team begins at an advantage. Compare trick-or-treaters at matching indices of both teams (e.g., 0 and 0 ). The team with a higher count of greater trick-or-treaters is at an advantage. Print out the appropriate string based upon the conclusion followed by a newline: - "cryptKickerFive is favored." - "ghoulGang is favored." - "Neither team is favored." - battle: This method takes in a positive int representing the winning candy threshold. A team's total candy count must be at least this amount to win. If the input is nonpositive, default to 60. The instructions below describe the actions that a team should perform in one "turn". Each trick-or-treater on the team will trick-or-treat. Following trick-or-treating, each ghost on the team will attempt to rob the trick-or-treater at the same index (e.g., 0 and 0) of the other team. Hint: Think of an operator that checks if a given reference has an "is-a" relationship with a class or interface. Although this HW defines only two specific kinds of trick-or-treaters, design your code to hold up even if there were more than two kinds. The battle should begin with the cryptKickerFive taking a turn. Each team must take at least one turn. The first team to meet the winning candy threshold after both teams take an equal number of turns wins. If both teams meet this threshold, they tie. Print out the appropriate string based upon the results followed by a newline: - "cryptKickerFive won!" - "ghoulGang won!" - "It is a tie!"](https://gotit-pro.com/wp-content/uploads/2023/10/beb898e9-40c1-4ccf-b6e5-9c62a908758c.png)
This is it, the big night! Everything comes together here. Variables: – TrickOrTreater[] cryptKickerFive – array of length 5 – TrickOrTreater[] ghoulGang – array of length 5 Constructors: – A constructor that takes in arrays for cryptKickerFive and ghoulGang (in this order). – You may assume that each input array is not null, and that neither array has null entries. Further, you may assume that each input array is of the expected length. You may shallow copy these arrays. Note: Even though this
InterfaceWrite a Java Program with the following guidelines:Create an Interface Shape with one method to compute area.Create a constant Math.PI for the circle inside this interface.Implement the interface for Circle, Square and Rectangle and build logic inside the method to compute the areas for the different shapes.Create a class called App with a main method that calls the compute are for each of the shapes and computes the area.
Create a simple to-do list application that allows users to add, remove, and mark tasks as complete. Firstly, start with a basic HTML structure. Then, use JavaScript to handle user interactions and update the list dynamically. Next, focus on implementing features like adding new tasks, checking off completed tasks, and deleting tasks. Additionally, enhance the project by incorporating features such as storing tasks in the browser’s local storage, enabling task prioritization, or adding due dates
7.5 LAB: Max of 3 – branch Write a program that stores the maximum of three values. The values are stored in $s0, $s1, and $s2. Store the result in $s3. Ex: If the values of $s0, $s1, and $s2 are initialized in the simulator as: – $s0 = 1 – $s1 = 5 – $s2 = 3 The result is stored in $s3. Note: Use the ‘+’ button under the Registers display to initialize register values for $s0, $s1, and $s2.
NOTE: This assignment assumes you have already completed Programming Challenges 4 and 5. Write a program that uses an instance of the Timeoff class you designed in Programming Challenge 5. The program should ask the user to enter the number of months an employee has worked for the company. It should then use the Timeoff object to calculate and display the employee’s maximum number of sick leave and vacation days. Employees earn 12 hours of vacation leave and 8 hours of sick leave per month.
BasicsAt a minimum you need ot be able ot open a file, edit it, and get out without breaking things. To open a file# vi newfile.You will be ni Normal mode. You can use the arrow keys to move in any mode. To begin typing you will need to be in Insert mode; to get there you can use• • •i —insert hereo- add a line below and insert there A- insert at end of current lineTo get back to Normal mode press ESC.Getting around ni Normal mode:• u-undo• CTL-r – redo• yy-‘yank’ (copy) the current line • dd –
Build ADT List Application 2: Counting Primes [40 pts]Suppose you are interested in finding prime numbers between 2 and 15 both inclusive.The algorithm proceeds in rounds. In each round a single prime is discovered fromCandidates list & removed, as also numbers that have that prime as a factor. For this, youwill need to create 3 lists, a Candidates list, a Composites list and a Primes listAssume Candidates list is as follows:Candidates: 2 3 4 5 6 7 8 9 10 11 12 13 14 15Step 1:Go through Candidat
