{q-1} (20 points) Listen You may use Replit to write and test all of the following questions: on: Write a class called TaskList which will implement a Queue datastructure of Tasks. The class must have an ArrayList (Java) or List (C#). It must have a method addTask which takes in a task (string) and adds it to the ArrayList/List. It must also have a method called getNextTask which takes no parameters, and returns a task (string), which is the next task to do. The getNextTask method should return the oldest task unless there are no tasks available, in which case it should return "Nothing to do" Write a main program which adds 3 items to the Tasklist and then removes the next 4 things from the TaskList. Print out each thing after you remove it. Paste (ctrl v) the entire code from repl.it into this box: 1 $ % 5. & 76 8@