15. Laser Beams and Balloons: Suppose you have a high-powered laser beam gun in your hand, standing amidst a number of large balloons in a vast open plateau. You want to use your laser gun to shoot all the balloons without moving from your current location. You want to fire as few shots as possible. The (2 dimensional) Minimum Beams Problem (MBP) can be stated more formally as follows. Given a set C of n circles in the plane, each specified by its radius and the (x, y) coordinates of its center, compute a minimum number of laser beam directions from the origin that collectively intersect every circle in C. Each such non-vertical beam nay geometrically be viewed as a half-line with the equation y-sx (with slope s) that is restricted to one of the 4 quadrants by an additional inequalityx 2 0 or x S 0.] Your goal is to find an efficient algorithm for this problem. 12 balloons hit by 5 laser beams. [Problem description continued on the next page.] 15. Laser Beams and Balloons: Suppose you have a high-powered laser beam gun in your hand, standing amidst a number of large balloons in a vast open plateau. You want to use your laser gun to shoot all the balloons without moving from your current location. You want to fire as few shots as possible. The (2 dimensional) Minimum Beams Problem (MBP) can be stated more formally as follows. Given a set C of n circles in the plane, each specified by its radius and the (x, y) coordinates of its center, compute a minimum number of laser beam directions from the origin that collectively intersect every circle in C. Each such non-vertical beam nay geometrically be viewed as a half-line with the equation y-sx (with slope s) that is restricted to one of the 4 quadrants by an additional inequalityx 2 0 or x S 0.] Your goal is to find an efficient algorithm for this problem. 12 balloons hit by 5 laser beams. [Problem description continued on the next page.]