In this problem, consider a non-standard sorting algorithm called the Slow Sort. Given an array A[1 : n] of n integers, the algorithm is as follows: Slow-Sort(A[1 : n]): 1. If n < 100, run merge sort (or selection sort or insertion sort) on A. 2. Otherwise, run Slow-Sort(A[1 : n −1]), Slow-Sort(A[2 : n]), and Slow-Sort(A[1 : n −1]) again. Question: Write a recurrence for Slow-Sort and use the recursion tree method to solve this recurrence and find the tightest asymptotic upper bound on the runtime of Slow-Sort.

In this problem, consider a non-standard sorting algorithm called the Slow Sort. Given an
array A[1 : n] of n integers, the algorithm is as follows:

Slow-Sort(A[1 : n]):
1. If n < 100, run merge sort (or selection sort or insertion sort) on A.
2. Otherwise, run Slow-Sort(A[1 : n −1]), Slow-Sort(A[2 : n]), and Slow-Sort(A[1 : n −1]) again.

Question: Write a recurrence for Slow-Sort and use the recursion tree method  to solve this recurrence
and find the tightest asymptotic upper bound on the runtime of Slow-Sort.