I've been given the next question but i am having truble with it .

we r given n points on the plane , and we need to find 2 circles that will cover all the points, while the the radius of the larger one is the minimum possible. (so we cant say we will take a very large circle).
we need to do it in O(n^7).

can som 1 tell me an answer to this problem? or even a known algorithm that close to it .

ive been thinking about this problem for 3 days and i cant think about anything..