A) The processing time of an algorithm is described by the following recurrence equation (c is a positive constant):
T(n) = 3T(n/3) + 2cn; T(1) = 0
What is the running time complexity of this algorithm? Justify.
B) You decided to improve insertion sort by using binary search to find the position p where the new insertion should take place.
B.1) What is the worst-case complexity of your improved insertion sort if you take account of only the comparisons made by the binary search? Justify.
B.2) What is the worst-case complexity of your improved insertion sort if only swaps/inversions of the data values are taken into account? Justify.
C) What is the running time complexity of the QuickSort when all elements of the array have the same value? Justify.
Please submit all answers ONLY as typed files (using i.e. MS Word, WordPerfect, TextMaker, LaTex, etc).