Make pseudocode to illustrates the counting sort algorithm. For simplicity of implementation and understanding, the range (a, b) within which the unordered set of keys lie is assumed to be within (0, k).

Why does binary search take less time than linear search, and what variables lead to this reduction? It would be helpful if you explained your actions.

During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.

What arrangement of keys is a best case for Bubble Sort, that is, for what input does it do the fewest comparisons? How many comparisons does it do in the best case?

Evaluations of algorithmsCalculate the algorithmic complexity of binary search in terms of time. Please offer detailed instructions.

3 illustrates the counting sort algorithm. For simplicity ofimplementation and understanding, the range (a, b) within which the unordered setof keys lie is assumed to be within (0, k).

Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array "a" from"index" to "n-1" index values.swap is a separate function that swaps elements in the given array "a" between theelements at index "k" and "index" respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then...

algorithm GetTerm (s, i) pre-cond: s is a string of tokens, andi is an index that indicates a starting point within s. post-cond: The output consists of a parsing p of the longest substring s[i], s[i + 1], ... , s[j − 1] of s that starts at index i and is a valid term. The output also includes the index j of the token that comes immediately after the parsed term.

Note that this is also a Data Structure question.