Given n sorted files, the task is to find the Optimal Merge Pattern with the fewest computations. The Optimal Merge Pattern is used when two or more sorted files are to be merged to form a single file. This file is reached by performing the fewest computations. If you need to merge more than two files, you can do so in pairs. For example, suppose you need to merge four files: A, B, C, and D. First, combine A and B to get X1, then combine X1 and C to get X2, and finally combine X2 and D to get X3 as the output file.

The total computation time for two files of size m and n is m+n. In this case, we employ the greedy strategy, merging the two files with the smallest size among all the files present.

So, we can see multiple merge patterns can be created from those 4 lists with different costs. We have to find out the optimal value. Remember, there may be more than one solution or pattern, but there must be only one optimal value. So now Be Greedy!!!