For each of the arrays below, show a visual representation of performing both merge sort and quick sort by drawing the merge-sort-trees and quick-sort-trees for each. Make sure to include the steps where the recursive calls return and the arrays are incrementally sorted into the correct order. When applying the quick-sort algorithm, you should choose the last index as your pivot value. a) 3 5 7 2 1 8 3 4 6 7 5 b) 5 2 1 6 8 9 c) 2 6 2 4 7 2 3 9 8 d) 1 5 7 4 8 3 5 4 Perform a radix sort on the following values by performing a bucket-sort for each character position, starting with the right-most character. you can get a key value by converting the character (a = 0, b = 1, c = 2, d = 3, and e = 4). For each time you perform bucket sort you should draw a visual representation of the sort showing all buckets as well as the entries in each bucket. cabac eeabc dbaae baddb ebacd cdbad ccaec abacb bbacb deded aadba bdaba