Make use of a random number generator to generate a list of 500 three-digit numbers. Create a sequential list FILE of the 500 numbers. Artificially implement storage blocks on the sequential list with every block containing a maximum of 10 numbers only. Open an index INDX over the sequential list FILE which records the highest key in each storage block and the address of the storage block. Implement Indexed Sequential search to look for keys K in FILE. Compare the number of comparisons made by the search with that of the sequential search for the same set of keys. Extend the implementation to include an index over the index INDX.

Using Java, 1. Implement external sort: for sort phase use normal sort,   for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data.  A sample input is as follow:Note:Fist input is max array size for sort           10   84   82   52   80   96   85   75   75   82   87  92   89   57   94   93   92   63   99   87  72   73   56   74   50   84   62   72   55   86   75  74  100   83   60   53   68   89   67  66  65   72   94   73   54   98   96   85   75   75   82   87  92   89

+ enuity.com/Player/ emester A 4 5 Mark this and return M BO DELL A user is going to process an unspecified quantity of numbers. The desired result is to have the numbers ordered from smallest to largest. Which statement is true? Select three options. You could use a loop to add the numbers to a list, and then use an insertion sort to order the list. You could use a loop to add the numbers to a dictionary, and then use a built-in sort method to sort the dictionary. You could use a loop to ask the user for the numbers, adding them to a list. Then use the built-in sort method to order the list. You could use a loop to add numbers to a list. Then use a binary search to sort the list. You could use a spreadsheet to enter the numbers, and then use the spreadsheet sort method from the menu to sort the numbers. Save and Exit Next < English Sign out Kinley TIME REMAINING 57:01 Submit D Mar 27 12:0

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 #…