Question 2: Recurrences (a) Below is the pseudo-code for two algorithms: Practice1(A,s,f) and Practice2(A,s,f), which take as nput a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we saw in class. Determine the worst-case runtime recurrence for each algorithm: T1(n) and T2(n). Show that T;(n) is O((log n)²) and T2(n) is O(n log n). Practicel (A,s,f) if s < f ql = [(s+ f)/2] if BSearch(A,s,q1,1) = true Practice2(A,s,f) if s < f if BSearch(A,s+1,f,1) = true return true return true else else return Practice2(A, s, f-1) return Practicel(A, ql+1, f) else else return false return false

Coding in Python, we have the function to perform this task, V col_Hdeg whichinputs the adjacency matrix A of the graph and initializes the array vert_color s tohold vertex colors. It then calculates the degree of each vertex and stores it in thearray degrees.The while loop iterates until all vertices are colored and at each iteration, thevertex v with the highest degree is colored. The array temp is used to find the currentcolors of the neighbors of vertex v and an unused smallest color is determined aftersorting this array.

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…

I am trying to work with some generic search algorithms in a coding homework, and I am having trouble understanding some of it. Here are my questions:   1. For this linear search algorithm below I am trying to send an array of x and y cordinate points into it and search to see if a specific x, y point is in the array, but I don't know how to send the points into the linear search function. By the way, I am using a struct point type for the array of points and the point I am looking for. (The below code is an exact example from our teacher during a lecture.)   void* linearSearchG(void* key, void* arr, int size, int elemSize, int(*compare)(void* a, void* b)) {   for (int i = 0; i < size; i++) {   void* elementAddress = (char*)arr + i * elemSize; if (compare(elementAddress, key) == 0) return elementAddress; } return NULL; }     2. I forgot what this line of code specifically does: void* elementAddress = (char*)arr + i * elemSize;   I need to code this myself, so if you could explain…