Using the information listed in the picture please answer the bulleted question.

There are three functions given and 4 questions that use one of the three functions to answer.

fori=s+1tofind=ifork=i1downtosifA[k]>A[i]ind=kbreakSwapA[i]andA[ind - Execute NewSort1 on array A=[8,4,6,10] indexed from s=1 to f=4. - Execute NewSort3 on array A={3,8,6,4} indexed from s=1 to f=4. - For each of the above three algorithms. determine if the algorithm is correct. You must justify each answer. - What is the worst-case number of comparisons made by NewSort2 on array A of length n ? - Determine the worst-case number of comparisons made by NewSort3 on array A of length n