PleasE ANSWER THESE QUESTIONS : Consider the following array: $97,8,7,45,13,325,9,1.$ Show a trace of execution for selection sort. The trace begins with the provided initial state of the array, followed by the array's state after each swap is made.

Enter each subsequent state as a comma separated list $($as shown by the initial state$).$ Do not include any spaces. Appeals based on not following specified format will not be considered.

initial: $97,8,7,45,13,325,9,1$

i $=0$:

$1,8,7,45,13,325,9,97$

Question $1\mathrm{.}1$ i $=1$: $,$Q$1\mathrm{.}2$ i $=2$: $,$Q$1\mathrm{.}3$ i $=3$: $,$ Q$1\mathrm{.}4$ i $=4$: $,$Q$1\mathrm{.}5$ i $=5$: $,$Q$1\mathrm{.}6$ i $=6$: $,$ Q$1\mathrm{.}7$ i $=7$: $,$ Consider the following array: $97,8,7,45,13,325,9,1.$ Show a trace of execution for insertion sort. The trace begins with the provided initial state of the array, followed by the array's state after each pass is made.

Enter each subsequent state as a comma separated list $($as shown by the initial state$).$ Do not include any spaces. Appeals based on not following specified format will not be considered.

initial: $97,8,7,45,13,325,9,1$

i $=1$:

$8,97,7,45,13,325,9,1$

Question

Q$2\mathrm{.}1$ i $=2$: $,$Q$2\mathrm{.}2$ i $=3$: $,$ Q$2\mathrm{.}3$ i $=4$: $,$ Q$2\mathrm{.}4$ i $=5$: $,$ Q$2\mathrm{.}5$ i $=6$: $,$Q$2\mathrm{.}6$

i $=7$: Give sortInts' Big$-$Oh order if its input was already sorted, where the expression bounds the number of swaps. Include a short explanation, and be sure that you are giving a relatively tight bound. public static void sortInts $($int $[]$ data$)\{$

for $($int i $=1$; i $<$ data.length; i$++)\{$

int i $=$ i;

while $($i $>0$ && data$[$i$-1]>$ data$[$i$])\{$ swap $($data$[$jl$,$ data$[$j$-1])//$f $($n$)$ counts these

j$--$; $\}\}\}$ What algorithm runs faster for an array in reverse order: selection sort, or insertion sort? Explain. $($Hint: you may need to consider multiple cost metrics.$)$