59. Question: Write a C++ program. Using Dynamic Array, read a data file containing some names into a dynamically declared array. Note that the total number of names is not known so your program should determine it. Create a second array that contains the names in alphabetical order. Produce an output file containing the alphabetized list. Important: Do not copy codes from prepinsta.com.

Debug the following phython code. """This function reads in data from the file specified by filename. This data is read line by line and unpacked into a single variable called data. argumentsfilename - the name of the file to be read returnsdata - a list of data, each element is a list that corresponds to the set of entries separated by commas in the original file. To access the first entry use data[0]. If x = data[0], then x[0], through x[3] will correspond to entries in the file that are read in. """ def read_file(filename):fin = open(filename,'r')line = fin.readline()data = []while line:data.append(parse_line(line))line = fin.readline()return data

C++ Problem!! Sort A List Of Integers Given a file of 100,000 unsorted integers, write a program that first prompt user to enter file name and reads those integers into an array and sorts the integers in the array. The program should then prompt the user for an index, and then display the integer at that index.  For example, if the array contains ten integers and the contents are 79  4  42  51  12  22  33  17  91  10 after sorting, the integer at index 6 is 42 Download the "List of 100,000 Unsorted Integers" from below link and sort that list, then enter the value at index 10000 (ten thousand) for a screenshot. https://1drv.ms/t/s!AuFS4mkcuYyBjHZ_SIudb93bq2uy?e=CsyvZj

This is for C++ Design an application that uses three identical arrays of at least 20 integers.  It should call each module on a different array, and display the number of swaps made by each algorithm.  8 Sorting Benchmarks (bubble, selection & insertion sort) The following represents the output from 3 separate files: BubbleSort, SelectSort and InsertionSort.  Don't ask the user to enter any numbers, but 'hard code' the values in the "Original order" as shown.    Original order:26 45 56 12 78 74 39 22 5 90 87 32 28 11 93 62 79 53 22 51Bubble Sorted:5 11 12 22 22 26 28 32 39 45 51 53 56 62 74 78 79 87 90 93Number of location swaps: 89   Original order:26 45 56 12 78 74 39 22 5 90 87 32 28 11 93 62 79 53 22 51Selection Sorted:5 11 12 22 22 26 28 32 39 45 51 53 56 62 74 78 79 87 90 93Number of location swaps: 19   Original order:26 45 56 12 78 74 39 22 5 90 87 32 28 11 93 62 79 53 22 51Insertion Sorted:5 11 12 22 22 26 28 32 39 45 51 53 56 62 74 78 79 87 90 93Number of location…