8. We discussed several sorting algorithms this semester. Of the following listed, answer the following questions: Mergsort, Insertion Sort, Quicksort, Counting Sort, Radix Sort a) What is the difference between the different sorting techniques? b) What is the complexity and how did you arrive at that answer? c) in what circumstances they are most useful? Explain your answer? d) On what input are they most useful? Explain your answer? 9. Consider the following four pieces of code: void f1 (int n) { int x = 2; int y = 1; while (y n) void f3 (int n) int x = 2; int y = 1; while (y n) { } y = y + x; x = x + 1; a) What is the cost of f 1? Answer: ( ) b) What is the cost of f 3? Answer: ( ) { y = y*x; x = 2*x; } Show your work for each part. A correct answer without proper reasoning will not get any points.