Given an array of integers, write a method to find indices m and n such that if you sorted elements m through n, the entire array would be sorted. Minimize n - m (that is, find the smallest such sequence). EXAMPLE lnput:1, 2, 4, 7, 10, 11, 7, 12, 6, 7, 16, 18, 19 Output: (3, 9)

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.

.Here an array of integers nums sorted in ascending order, find the startingand ending position of a given target value. If the target is not found in thearray, return [-1, -1]. For example:Input: nums = [5,7,7,8,8,8,10], target = 8Output: [3,5]Input: nums = [5,7,7,8,8,8,10], target = 11Output: [-1,-1].

Given n arrays, each array contain n positive integers. Write an O (n² log n) algorithm to find the smallest n sums out of nn possible sums that can be obtained by picking one positive integer from each of n arrays. For example, given three arrays as follows: [5, 1, 8], [5, 2,9], and [6,7, 10]. The smallest n sums of the given array is [9, 10, 12].