For sorter specified, provide each of the following items: Summary of algorithm Performance: o Identify best, worst, and average cases, provide Big-Oh for each, and explain reasons for differences (or similarities) among the already sorted, reverse order, and random cases. o Make observation of timings (ie support/disprove your best, worst, average case performance). Stability o State whether or not the algorithm is stable as written and provide an example to support it. o If implementation can effect stability, explain how.