You are given an array A[1,,n] of integers (each element may be positive, negative or zero). Recall that a subarray A[i,j] of A, where ij, consists of the elements A[i],A[i +1],A[i+2],,A[j] (i through j are consecutive indices of A ). We say that subarray A[i,,j] is special if each element of the subarray contains a value that is a multiple of 5 . This problem asks you to devise a divide-and-conquer algorithm to determine the length of a longest special subarray of the given array. Your algorithm must run in time o(n2). Note, this is little-o. Your answer must include the following. (a) Indicate clearly what actions are to be performed in the Divide, Conquer and the Combine steps of your algorithm. As part of the Conquer step, be sure to indicate when recursion ends, and the value returned when recursion ends. Also, specify the actions of the Combine step of your algorithm carefully. We can determine if a number is a multiple of 5 in O(1). (b) Let T(n) denote the running time of your algorithm when A has n elements. Develop a recurrence for T(n), and by solving the recurrence, show that T(n)= o(n2). Again, note, here is little-o. You should know that nlogn=o(n2), but n2 is NOT o(n2)