Question: please answer this ASAP asesb). Develop an algorithm such that given a list of intervals, and a list of points in x-axis, it gives a
please answer this ASAP

asesb). Develop an algorithm such that given a list of intervals, and a list of points in x-axis, it gives a least number of intervals from the given list to cover all points in the input list. For example, assume that the input list of intervals is [1.S]. 12.3), and [7, 12), and ts is 1.3, 4, 8, 10. The points in the input list can be covered by [1.5] and [7 12] in the interval list of the input. Please design a dynamic programming algorithm, and give is time complexity. the input list of poirn
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
