A. depends on Boyer-Moore string matching algorithm perform the following: Write an efficient algorithm that presents the algorithm methodology. Derive time efficiency in Best and Worst Cases for the above code. The Quicksort algorithm based on divide and conquer algorithm. Explain the difference between it and merge sort. If the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28 Apply the quick sort on the above list by using the pivot is always the left item and find the following 1. The list after a first partition call 2. The split point in the second partition call