Use scnr to read each pair of inputs, string currName and integer currPopulation, until "done" is read from input. Create each Town object with currName and currPopulation as arguments and append each object to ArrayList townList. Ex: If the input is Goshen 3200 Jackson 3300 Asaph 2600 Natrona 2800 done, then the output is: Town: Goshen, Population: 3200 Town: Jackson, Population: 3300 Town: Asaph, Population: 2600 Town: Natrona, Population: 2800 2 import java.util.ArrayList; 3 4 public class Towns { 5 public static void main(String[] args) { Scanner scnr = new Scanner (System.in); 6 7 8 9 10 11 12 13 14 Towns.java Town.java 15 16 17 ArrayList townList = new ArrayList(); Town currTown; String currName; int currPopulation; int i; /* Your solution goes here for (i = 0; i < townList.size(); ++i) { currTown townList.get(i); currTown.print();

---for example, Data abstraction is a powerful concept in computer science that allows programmers to treat code as objects car objects, chair objects, people objects, etc. That way, programmers don't have to worry about how code is implemented they just have to know what it does. Data abstraction mimics how we think about the world. For example, when you want to drive a car, you don't need to know how the engine was built or what kind of material the tires are made of. You just have to know how to turn the wheel and press the gas pedal. An abstract data type consists of two types of functions: • Constructors: functions that build the abstract data type. • Selectors: functions that retrieve information from the data type. For example, say we have an abstract data type called city. This city object will hold the city's name, and its latitude and longitude. To create a city object, you'd use a constructor like city=make_city (name, lat, lon) To extract the information of a city object,…

Language Python

Suppose you have created a new class: SortedLinkedList. This class is derived from LinkedList (single links). You are asked to overload the method Insert. The method Insert will no longer take in a parameter position, this is because now Insert will place the element in the correct position such that the list is always sorted. Write the C++ code for the implementation of that Insert method.

can you give me the code to the following question

Hello!I'm currently in the process of developing an algorithm for a reverse method for a singly-linked list--not an array, which is a much easier algorithm and I have done before. I'm writing in Java. I'm working from a pre-written SinglyLinkedList class with certain methods (intentionally) empty, for us to fill.I have, unbelievably, spent somewhere around 5 hours going through drafts. The easiest implementation I've conceived of would be to create a second list with which to import the nodes and elements starting from the tail. public void reverse() {<Integer> list2 = new SinglyLinkedList();for (size) {  list2.addLast(tail);  list1.remove(tail); }}This is the rough draft pseudocode for the aforementioned implementation.If we were to work within the same list, instead of creating a new one we would have to go through, for a size of 10, a hundred iterations. Obviously, there are a number of problems.First, reverse() has been defined as a void method. It's not supposed to return…