Following is the implementation of the class Task (slightly modified from. class Task: definit__(self, title, completed, required_taskers) -> None: self.title= title #String self.completed = completed #Boolean- True/False self.required_taskers = required_taskers #Integer 1. Write a modified version of the class Task so that every Task() object created is stored in a list object titled_list_of_tasks of the class TaskList()) 2. Write a method task-total () of the class TaskList() that returns the total number of completed tasks (an integer) and the total number of required taskers (an integer)

Write a python hangman program Modify your program so that the following functionality is added:1. Instead of selecting the word from a hard coded list, incorporate problem2 so that thelist is read from a file, then a word is randomly selected from this list.2. when the game ends, the following information should be outputted to a new file:● the word● the state of the hangman● if the user won or lostExample outputs:quokkaO\||You won!kangarooO\|/|/ \You lost

The two classes you will create will implement the operations defined in the interface as shown in the UML class diagram above.  In addition,  BinarySearchArray will implement a static method testBinarySearchArray() that populates the lists,  and lets the user interactively test the two classes by adding and removing elements.  The parameter BinarySearch can represent either class and tells testBinarySearchArray which class to test.   Steps to Implement:   1) To get started create a new project in IntelliJ called BinarySearch.  Add a class to your project called BinarySearchArray.  Then add another class  BinarySearchArrayList and an interface called  BinarySearch.  The interface BinarySearch includes public method stubs as shown in the diagram.   You are allowed to add BinarySearchArrayList to the same file as BinarySearch but don't add an access modifier to this class, or for easier reading, you can declare the classes in separate files with public access modifiers.   Only the class…

QueueArray.java This file implements QueueInterface.java This file has * attributes of an array holding queue elements. An integer represents front * index, an integer for rear index, and an integer to keep track number of * elements in the queue. An overloaded constructor accepts an integer for * initializing the queue size, e.g. array size. An enqueue method receives an * object and place the object into the queue. The enqueue method will throw * exception with message "Overflow" when the queue is full. A dequeue method * returns and removes an object from front of the queue. The dequeue method * will throw exception with message "Underflow" when the queue is empty. A size * method returns number of elements in the queue. A toString method returns a * String showing size and all elements in the queue.

Design a class called Post. This class models a StackOverflow post. It should have properties for title, description and the date/time it was created. We should be able to up-vote or down-vote a post. We should also be able to see the current vote value. In the main method, create a post, up-vote and down-vote it a few times and then display the the current vote value.

A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.

Each object that is created from its "template" is called a(n) ?

Pythong help!

Java -  This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select.  You will implement the following:   Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research)   General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from…

Complete the Kennel class by implementing the following methods: addDog(Dog dog) findYoungestDog() method, which returns the Dog object with the lowest age in the kennel. Assume that no two dogs have the same age. Given classes: Class LabProgram contains the main method for testing the program. Class Kennel represents a kennel, which contains an array of Dog objects as a dog list. (Type your code in here.) Class Dog represents a dog, which has three fields: name, breed, and age. (Hint: getAge() returns a dog's age.) For testing purposes, different dog values will be used. Ex. For the following dogs: Rex Labrador 3.5 Fido Healer 2.0 Snoopy Beagle 3.2 Benji Spaniel 3.9  the output is: Youngest Dog: Fido (Healer) (Age: 2.0)