QQ$4.(25$ pts$)$ Consider the following array representing the sizes of $10$ files. Use the greedy strategy discussed in the slides to merge two files at a time until all the files are merged into one.

We want to merge two files at a time and go through a sequence of mergers $($extra space is needed to store the file resulting from the merger of two files$)$ to come up with a final merged file.

Determine the sequence of file mergers such that the total extra space used to store the merged files is the minimum.

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9],[3,8,7,9,5,4,10,8,6,6]]$