Merge and quick sort Implementation – Directed Lab Work 1. Complete the recursive algorithm for merge sort part in the given data file,  ArraySortRecursive.java.  2. Complete the implementation of quick sort by implementing the method partition in the given data file, ArraySortRecursive.java. 3. Save the file as ArraySortRecursiveYourlastname.java.  4. Save the test driver program as DriverYourlastname.java and run the program and verify.

Java Program ASAP   Please modify  Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt"); in the program so it reads the two text files and passes the test cases. Down below is a working code. Also dont add any import libraries in the program just modify the rest of the code so it passes the test cases.    import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class MorseCodeConverter {    public static void main(String[] args) {        Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt");        Scanner scanner = new Scanner(System.in);        System.out.print("Please enter the file name or type QUIT to exit:\n");        do {            String fileName = scanner.nextLine().trim();            if (fileName.equalsIgnoreCase("QUIT")) {                break;            }            try {                String text =…

This code gets an error for going out of range in the last for loop. What can I do to fix this?   # Lucas Conklin# 5772707import csvimport statistics def readCSVIntoDictionary(f_name):    data = []    with open(f_name) as f:        reader = csv.reader(f)        for row in reader:            if not data:                for index in range(len(row)):                    data.append([])            for index in range(len(row)):                data[index].append(float(row[index]))        f.close()    return data features = readCSVIntoDictionary("C:\\Users\\lucas\\Downloads\\pima.csv")print(features) def find_median_and_SD(data, feature):    med = statistics.median(data[feature])    rounded_med = round(med, 4)    st_dev = statistics.stdev(data[feature])    rounded_st_dev = round(st_dev, 5)    return rounded_med, rounded_st_dev for i in range(0, len(features)):    (median, st_dev) = find_median_and_SD(features, i)    print(f'Feature {i} Median: {median} Standard Deviation: {st_dev}')…

starter code //Provided imports, feel free to use these if neededimport java.util.Collections;import java.util.ArrayList; /** * TODO: add class header */public class Sorts {    /**     * this helper finds the appropriate number of buckets you should allocate     * based on the range of the values in the input list     * @param list the input list to bucket sort     * @return number of buckets     */    private static int assignNumBuckets(ArrayList<Integer> list) {        Integer max = Collections.max(list);        Integer min = Collections.min(list);        return (int) Math.sqrt(max - min) + 1;    }     /**     * this helper finds the appropriate bucket index that a data should be     * placed in     * @param data a particular data from the input list if you are using     *             loop iteration     * @param numBuckets number of buckets     * @param listMin the smallest element of the input list     * @return the index of the bucket for which the particular data should…

Use Java pl DataFileWords.txt: lovegentlensslovepeacelovekindnesslovepeaceunderstandingkindnessjoypeaceunderstandingfriendshipgentlenssgoodnesslovepeacegoodnesslovegentlensscontrolunderstandingunderstandinggentlensslovepeacepatiencecontrolkindnessgentlensslovepeacejoygoodnesspeacefriendshipgoodnesskindnesslovepeacegoodnesscontrolpatiencejoygentlensspatiencegentlensspatiencekindnessgoodnessjoygentlenssgentlenss

package Q2;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.util.ArrayList;import java.util.Scanner;public class Question2 {public static void main(String[] args) throws FileNotFoundException {/*** Part a* Finish creating an ArrayList called NameList that stores the names in the file Names.txt.*/ArrayList<String> NameList;/*** Part b* Replace null on the right-hand-side of the declaration of the FileInputStream object named inputStream* so that it is initialized correctly to the Names.txt file located in the folder specified in the question description*/FileInputStream inputStream = null;Scanner scnr = new Scanner(inputStream); //Do not modify this line of code/*** Part c* Using a loop and the Scanner object provided, read the names from Names.txt* and store them in NameList created in Part a.*//*** Part d* Reorder the names in the ArrayList so that they appear in reverse alphabetical order.*/// System.out.println("NameList after correct ordering: "…

rers? Start searching... SPTED Search 1 VitalSource Xx d VitalSource X d VitalSource x * Programmi x O 06 Boyle's LX 6 06 Boyle's x /#/books/9781119321071/cfi/6/354!/4/2@0.00:100 Start over ... 9. In the preceding exercises, you saw how one can use stepwise refinement to solve the problem of translating Wiki markup to HTML. Now turn the pseudocode into code. Complete the convertToHTML and nextSymbol methods in the following class. WikiMarkup.java 1 import java.util.Scanner; 3 public class WwikiMarkup 4 { public static void main(String[] args) { 7. 5 6. Scanner in = new Scanner (System.in); String message = in.nextLine(); System.out.println(convertToHTML (message)); } 8 9 10 11 12 13 /** Converts a message with Wiki markup to HTML. @param message the message with markup @return the message with Wiki notation converted to HTML 14 15 16 17 18 19 20 21 22 23 24 25 public static String convertToHTML (String message) String result = message; return result.replace("\\", ""); /** Finds the…

Please design the mapper and reducer for the below WordCount problem. WordCount problem: Given an input text file, count the frequency of each word in the file. Please design the input and output pairs for the Mapper and Reducer, use below table for reference. Input Output We get the "WordCount.jar" file by using the above table. It only contains Mapper and Reducer. There is no Combiner and no Partitioner in this program. Please illustrate how the WordCount.jar program works on the below dataset. This text file only contains one line. Dataset: the sound sounds sound. it is the right right, right? Suppose we run the WordCount.jar program on this file. Suppose that the space symbol, and "?" are all used for separating the words. The outputs of the Mapper are Mapper The outputs of the reducer are Reducer Answer: Are the results sorted alphabetically? When was it sorted? 2 27 20 35

In Python NO IMPORT PICKLE Please check pictures and fix code. Write a program that keeps names and email addresses in a dictionary as key-value pairs.   This is the Required Output example:   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5. Quit the program   Enter your choice: 2 Enter name: John Enter email address: John@yahoo.com That name already exists   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5. Quit the program   Enter your choice: 2 Enter name: Jack Enter email address: Jack@yahoo.com Name and address have been added   Menu ---------------------------------------- 1. Look up an email address 2. Add a new name and email address 3. Change an existing email address 4. Delete a name and email address 5.…