Answer:
A. the museum can choose a heuristic approach which will achieve a lossless compression, but they cannot be sure that it is the most efficient compression for each image
C. algorithms for lossless compression exist, so the museum can use those to compress the image
Explanation:
The answer would be...<span>ACLs</span>
Answer:
The answer is "Option C".
Explanation:
The array was already sorted. Much new information is applied to the array on a recurring basis at random indices, to bring everything back in order. During in the sort, I wouldn't want to use much further memory.
It is a sorting algorithm that constructs one piece at a time in the final sorted array. In large lists, it is far less effective than sophisticated technology like quicksort, heapsort, or combination sort.