Write Algorithm to Removing Some Redundancies Input : a base B = [91, ~2 ..... ~k]; a strong generating set S of a group G; Output  9 a subset T of S that is also a strong generating set of G relative to B; write accurate ans otherwise  you will get downvote

Consider this alogrithm:// pre: array A of length n, each A[i] is picked randomly uniformly// from the set {0,1,2,3,4,5,6,7,8,9}.// post: return the index of the first occurrence of "check digit" of A// (already computed in the code)// return -1 if check digit is not foundint FindCheckDigit(A) {check_digit = 0for (i=0; i < n; i++)     check_digit = check_digit + A[i]check_digit = check_digit % 10 # % means remainder of divisionfor (i = 0; i < n; i++) {     if (A[i] == check_digit) {          return i     }}return -1;}Compute the average runtime for this algorithm. Show all details of your computation for both loops.

Apply also the equal distance binning method in the sorted values The sorted values are distributed into a number of “buckets,” or bins. Price = 4, 8, 15, 21, 21, 24, 25, 28, 34, 36, 40, 50 Equal-frequency bins of size 3. Partition into (equal-frequency) bins:  In smoothing by bin means, each value in a bin is replaced by the mean value of the bin. Smoothing by bin means: In smoothing by bin boundaries, each bin value is replaced by the closest boundary value. Smoothing by bin boundaries:

Consider a set of random numbers IIDR [0,1] = [0.11,0.63,0.37,0.08,0.71,0.56,0.45,0.29,0.68]. Convert the set of random number to a set of random variates for N(0,1). Further convert this set of random variates to another set for N(5,3). Present the random numbers and the random variates in a Table as sought below. S.no IIDR[0,1] Random Variates for N(0,1) Random Variates for N(5,3)