1. Revises the function quickSort so that it always chooses the first item in the array as the pivot. Add a counter to the function partition that counts the number of comparisons that are made. Compare the behavior of the revised function with the original one (pivot should be selected using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the difference in the number of comparisons become significant? For which pivot selection strategy does the difference in the number of comparisons become significant? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 and clock() function.). For comparison, you need to create two tables for execution times and a counter for both algorithms

Code in C. Solve the code below.    Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq".   int busca_seq(int vetor[], int n, int b) {    //your code }   My Code   #include<stdio.h> int busca_seq(int vetor[], int n, int b) {  int i;  for(i = 0; i < n; i++){   if(vetor[i] == b)    return (i+1);  }    {  int vet[5],n = 5,b,x;    vet[0] = 1;  vet[1] = 2;  vet[2] = 3;  vet[3] = 4;  vet[4] = 5;    scanf("%d",&b);  x = busca_seq(vet,n,b);  printf("%d",x);      return 0;  }  }

2. Fill in the for-loop below with the correct parameters to make room for the new value. saved Let's say that you have to write a function to insert an element into an ordered array. It takes an array A, a size, an index and a value. The value needs to be inserted at Aſindex] without losing values that are already in the array. // Assume that the index is found to be within array bounds and there is room to insert. for (int i = ?; ?; ?) { A[i]=A[i-1]; } A[index]=value; size++; O 0; i 0; - O size; i> index; -- O size-1; i>= index; i--