Algorithms: Counting sort, Radix sort, Bucket sort, Quick sort, Merge sort, Selection sort, Insertion sort

2. (4 points) There is an n sized array which contains integers in the range [1, n]. Which sorting algorithm (amongst the ones covered in class) should we use and why? List all the sorting algorithms that we covered in lectures, tell us how long each of them could take in this situation, and then tell us why you picked the algorithm that you did. No pseudocode needed here. The points are for the discussion of the algorithms. Please note that if you want to tweak/modify any of the algorithms, you have explicitly mention what the modification would be