JAVA: Use natural split to split the bonus_txt file, then use natural merge to merge the two resulting files back together. What is the value at index 100?  200 998 744 735 402 22 387 547 944 76 50 85 395 603 121 453 552 27 658 576 961 975 436 235 111 691 870 392 391 340 660 947 522 664 771 575 275 847 222 992 68 763 975 14 226 763 114 108 502 997 430 654 730 857 443 60 339 500 910 961 824 571 835 196 152 170 78 927 537 857 690 282 955 962 244 144 287 749 536 268 975 81 199 744 669 31 999 905 384 537 753 228 344 609 134 363 819 774 859 479 945 406 120 265 732 371 445 488 210 907 576 805 916 14 344 579 780 686 7 844 742 225 938 172 348 513 122 153 955 565 404 362 101 899 38 218 68 283 686 860 654 159 618 259 690 646 580 69 910 362 450 373 342 398 547 336 539 745 224 972 585 95 146 673 19 459 500 906 520 278 208 459 430 721 131 960 988 705 134 941 440 743 847 601 18 118 945 537 178 23 739 167 354 268 963 248 934 844 664 886 128

Create a file called toArray.js that reads n strings from the command line, adds them to an array, and returns them in order that they were entered. You must use a forEach loop for this file. The output will contain the size of the array and the array itself.

This question is for Java, and in the picture provided.

Ask the user for a filename. Display the oldest car for every manufacturer from that file. If two cars have the same year, compare based on the VIN. I am having trouble with a specific line of my code here is my code import java.util.Comparator; import java.io.File; import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; class Car { String manufacturer; String model; int year; String vin; public Car(String manufacturer, String model, int year, String vin) { super(); this.manufacturer = manufacturer; this.model = model; this.year = year; this.vin = vin; } public String getManufacturer() { return manufacturer; } public void setManufacturer(String manufacturer) { this.manufacturer = manufacturer; } public String getModel() { return model; } public void setModel(String model) { this.model = model; } public int getYear() { return year; } public void setYear(int year) { this.year = year; } public String getVin() { return vin;…

def upgrade_stations(threshold: int, num_bikes: int,                     stations: List["Station"]) -> int:    """Modify each station in stations that has a capacity that is less than    threshold by adding num_bikes to the capacity and bikes available counts.    Modify each station at most once.     Return the total number of bikes that were added to the bike share network.     Precondition: num_bikes >= 0

how can i remove the spaces at the end of each line in my code ?   code: def load_course(course_name):try:file = open(course_name+'.txt')return file.readlines()except FileNotFoundError as e:return None def word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) > lineWidth:lines.append(line)line = ''line += word + ' 'linelen = len(line)if line !='':lines.append(line)return '\n'.join(lines) def enhanced_word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) + 1 > lineWidth:lines.append(line + word[:lineWidth-linelen])line = word[lineWidth-linelen:] + ' 'else:line += word + ' 'linelen = len(line)if line != '':lines.append(line)return '\n'.join(lines) lineWidth = int(input("")) while True:course = input("")if course == 'q':breaklines = load_course(course)if lines == None:print('Unable to load course information for course',course)else:for…

Write a program (call it intersection.py) that finds all gene symbols that appear both in the chr21_genes.txt file and in the HUGO_genes.txt file. These gene symbols should be printed to a file in alphabetical order (you can hard code the output file OUTPUT/intersection_output.txt) . The program should also print on the terminal how many common gene symbols were found. Use Lists or Sets to solve the problem. It is fine to use a temporary Dictionary to find the intersection of two Lists, but this can be simplified with Sets. Note: HUGO_genes.txt could have some duplicate entries.Remember to have these command line options:$ python3 intersection.py -h usage: intersection.py [-h] -i1 FILE1 -i2 FILE2 Provide two gene list (ignore header line), find intersection optional arguments: -h, --help show this help message and exit -i1 INFILE1, --infile1 INFILE1 Gene list 1 to open -i2 INFILE2, --infile2 INFILE2 Gene list 2 to open $ python3 intersection.py -i1 chr21_genes.txt -i2 HUGO_genes.txt #…

def analyze_file (filename: str, pos_words: List [str], neg_words: List [str]) -> Given the name of a file, a list of positive words (all in lowercase), and a list of negative words (all in lowercase), return some interesting data about the file in a tuple, with the first item in the tuple being the positivity score of the contents of this file, and the rest of the item: being whatever else you end up analyzing. (Helper functions are highly encouraged here.) How to calculate positivity score: For every word that is pos itive in the file (based on the words in the list of positive words) add 1 to the score. For every negative word (based on the list of negative words), subtract 1 from the score. Any neutral words (those that do not appear in either list) do not affect the score in any way. pass

Write a complete program that sorts dword unsigned integer array in descending order. Assume that the user doesn’t enter more than 40 integers. You MUST use the template-1-2.asm Download template-1-2.asm        and follow all the directions there. Note: you have to review 3 peer assignments.   You can’t add any more procedures to the template. The procedures can’t use any global variables (variables that are inside .data segment). The caller of any procedures sends its argument through the stack. Inside any procedures, if you need to use a register, you have to preserve its original value. You can't use uses, pushad operators. The callee is in charge of cleaning the stack Sample run: Enter up to 40 unsigned dword integers. To end the array, enter 0. After each element press enter:  1 4 3 8 99 76 34 5 2 17 0 Initial array: 1 4 3 8 99 76 34 5 2 17 Array sorted in descending order: 99 76 34 17 8 5 4 3 2 1 template-1-2.asm include irvine32.inc ;…

How can I read from a file a string version of a nested dictionary and store as a dictionary? For example, I have the following nested dictionary: {1: {'Name': 'Bob', 'Pass': 'pass123', 'Sports': ['Hockey', 'Football'], 'Activities': ['eating', 'sleeping']} ; 2: {'Name': 'Kayla', 'Pass': 'cyansus', 'Sports': [], 'Activities': []}} To write this to a file I needed to convert to a string (and it is fine writing to a file). But I am having trouble reading this from the file and creating a nested dictionary from it. I can read the string in fine but creating the nested dictionary I am lost at. Any help will be appreciated. Thank you