Consider the following snippets of code.  Then, identify and describe the sorting algorithm used.  num scores[5] = 90,85,65,95,75  sort()    x = 1    while x < SIZE           temp = scores[x]           y = x – 1           while y >= 0 AND scores[y]>temp                       scores[y+1] = scores[y]                       y = y – 1           endwhile           scores[y+1] = temp           x = x + 1   endwhile return

3 illustrates the counting sort algorithm. For simplicity ofimplementation and understanding, the range (a, b) within which the unordered setof keys lie is assumed to be within (0, k).

Sort the following in order of asymptotic order: fa(n) = n" f2(n) = nvn f3(n) = 2" fa(n) = f4(n/2) + n

6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec