A sensor of range r > 0 is modelled as an interval r-r,x +r] centered at a point x, where r [0,1]. Two sensors s1, s2 are dropped in the unit interval [0, 1: one occupies position r1 and the other position r such that 0 s ri,r2 1. We want to move the sensors (if needed) to ensure that every point in the unit interval is within the range of a sensor (i.e., the interval is covered by the two sensors). 1. Give an optimal algorithm to accomplish this coverage task which minimizes the sum of the movements of the two sensors (as a function of r1, r2) assuming that r = 1/2 2. Now sup he two sensors are droppdai rado in the it interval. ofthe iwo or e alhm yon What is ihe xpxicxlsu of the mov designed? A sensor of range r > 0 is modelled as an interval r-r,x +r] centered at a point x, where r [0,1]. Two sensors s1, s2 are dropped in the unit interval [0, 1: one occupies position r1 and the other position r such that 0 s ri,r2 1. We want to move the sensors (if needed) to ensure that every point in the unit interval is within the range of a sensor (i.e., the interval is covered by the two sensors). 1. Give an optimal algorithm to accomplish this coverage task which minimizes the sum of the movements of the two sensors (as a function of r1, r2) assuming that r = 1/2 2. Now sup he two sensors are droppdai rado in the it interval. ofthe iwo or e alhm yon What is ihe xpxicxlsu of the mov designed