We have discussed the divide-and-conquer polynomial multiplication algorithm, where each polynomial is partitioned into the high half and lower half. What if we partition the polynomials according to the index is even or odd. Will the divide-and-conquer approach still work? Explain why or why not. The input is a set of intervals on the X-axis, which are represented by their two endpoints. Design an algorithm to identify all intervals that are contained in another interval from the set. The algorithm should run in O(nlogn) time