Consider the Insertion Sort algorithm presented in class. Provide clear, concise answers to each of the following related questions. (6 points). The specification for Insertion Sort requires that the output be a permutation of the input, with some ordering. In one sentence, explain why the permutation requirement is important. (8 points). The inner loop of Insertion Sort copies elements one at a time, from left to the right. Give an example input array with five elements for which this inner loop makes zero copies in total. (8 points). The inner loop of Insertion Sort copies elements one at a time, from left to the right. Given an example input array with five elements for which this inner loop makes ten copies in total.

Question #1 (22 points) Consider the Insertion Sort algorithm presented in class. Provide clear, concise answers to each of the following related questions. (6 points). The specification for Insertion Sort requires that the output be a permutation of the input, with some ordering. In one sentence, explain why the permutation requirement is important. (8 points). The inner loop of Insertion Sort copies elements one at a time, from left to the right. Give an example input array with five clements for which this inner loop makes zero copies in total. . (8 points). The inner loop of Insertion Sort copies elements one at a time, from left to the right. Given an example input array with five elements for which this inner loop makes ten copies in total