2. Write a set of guidelines for helping someone decide which sort algorithm would be most appropriate for a particular situation. Include in your guidelines a description of the advantages and disadvantages of cach algorithm, together with an indication as to why those characteristics apply. Your goal is to provide enough information so that someone not familiar with the details of cach algorithm would be able to decide which algorithm is right for them For example, if somcone was considering using counting sort, then the following brief information could help decide if it was appropriate. Computer Programming 2 Algorithm Counting Sort Description Count the number of times each different value appears, then overwrite the values in lowest-to-highest order, with cach value repcated according to the counts. Advantages Usually faster than any of the comparison-based sorts. Algorithmic complexity is O(n +k), irrespective of data order, where n is the list length and k is the number of distinct values that might occur. Typical case is where k