Using the algorithm above, please, do the following tasks (instead of Flashsort implement described algorithm):

For example. if there is an array , it is after the first recursive step, after the second recursive step, and after the final recursive step.

a. If the sequence length is at most 4, sort using bubble sort. Else do the following: Divide the array into 5 equal pieces by scanning the entire list. b. Sort the first 3/5 of the array recursively. Sort the last 3/5 of the array recursively. d. Sort the first 3/5 of the array recursively. c. Write down a runtime recurrence for FlashSort and analyze its asymptotic running time. Give an example array for size n = 5 or n = 10 integers where FlashSort does not terminate with the correct answer. Implement FlashSort (even though it doesn't work correctly!)