Using c++. implement merge sort and insertion sort programs to sort an array/vector of integers. you may implement the algorithms in c++ language, name one program "mergesort" and the other "insertsort". your programs should be able to read inputs from a file called "data. txt" where the first value of each line is the number of integers that need to be sorted, followed by the integers. example values for data. txt: 4 19 2 5 118 1 2 3 4 5 6 1 2the output will be written to files called "merge. out" and "insert. out".for the above example the output would be: 2 5 11 191 1 2 2 3 4 5 6

nope i prefer two because it is simpler, i don't like all the powers you get

explanation:

but that's my opinion

answer: internal fragmentation is the difference between the (fixed) size of a memory hole and the data within in that memory. for example, if a 1,024 byte block of memory holds 800 bytes of data, then the 224 bytes difference is considered lost to internal fragmentation.

external fragmentation occurs when the sum of memory fragments is large enough to satisfy a request, but the holes are non-contiguous and the request cannot be satisfied. this can occur when memory is dynamically allocated and freed.

explanation: