Please explain your answer, no code needed just give the algorithm(steps)

Thank you so much.

4) (Maximum subunit product) (40 points) Given a one-dimensional array A[1:n] of positive real numbers, a maximum subunit product is a subarray A[i:j] such that the product of its elements ikjA[k] is both: (1) strictly less than one, and (2) maximum. In other words, a maximum subunit product is a subarray of A for which the product of its elements is as close to 1 as possible without hitting or exceeding 1. (a) (40 points) Using the divide-and-conquer strategy, design an algorithm that finds a maximum subunit product in an array of length n in O(nlog2n) worst-case time. (Hint: Recall that n values can be sorted in O(nlogn) worst-case time. You may also need to know that the recurrence T(n)=2T(n/2)+O(nlogn) has the solution T(n)=O(nlog2n).)