the requirement that it needs to use 4 tapes as temporary storage for the sorting. According to the requirements, code should perform an algorithm like this: http://faculty.simpson.edu/lydia.sinapova/www/cmsc250/LN250_Weiss/L17-ExternalSortEX1.htm

must use 4 steps, T1-T4 to complete this prolem

Description: Create a class called ExternalSort. Your class should have the following methods. You may add additional methods as needed. You may use code from the textbook, but all other code must be your own. 80 points a) public static Path extsort(Path t1, int runsize) Uses the external sort procedure illustrated in chapter 7 to sort the file represented by Path t1 using the passed size as the run size and returns a Path to the sorted result. For the tapes, use files named T1-T4. The data should already be on T1 when this method is called. You can assume the data consists of Integers. Your sort should work even if the number of input items is not a multiple of the run size. Note that "Path" is an object in Java's "java.nio.file" package. 20 points b) public static void main(String args[]) Accepts run size as a command line argument. Assumes input already exists on a file named T1. Calls the external sort routine. Prints the path object which gives the path to the sorted file.

the picture shows below, please help me with T1-T4 STEP

Tl has the input data to sort ?? 5718215568143964 T2 Suppose 4 at a time can be sorted in memory. Each sorted run is written to an alternate tape. T3/15 7 8 1 468 T412 5 5 3 4 6 9 Now, merge corresponding runs ??//1 1 2 5 5 5 7 8 T2 1 3 4 4 6 6 8 9 and continue merging until everything is in one list. T3 1 1 1 2 3 4 4 5 5 5 6 67 8 8 9 Tl has the input data to sort ?? 5718215568143964 T2 Suppose 4 at a time can be sorted in memory. Each sorted run is written to an alternate tape. T3/15 7 8 1 468 T412 5 5 3 4 6 9 Now, merge corresponding runs ??//1 1 2 5 5 5 7 8 T2 1 3 4 4 6 6 8 9 and continue merging until everything is in one list. T3 1 1 1 2 3 4 4 5 5 5 6 67 8 8 9