a$)(10$ Points$)$ Design a polynomial$-$time algorithm for the following problem. Given the

positions of a set for clients and a set of base stations, as well as the range and load pa$-$

rameters, decide whether every client can be connected simultaneously to a base station,

subject to the range and load conditions.

$($b$)(10$ Points$)$ Write the condition of the feasible solution $($i$.$e$.,$ connecting all clients to

base stations$).$

$($c$)(5$ Points$)$ Analyze the running time of your algorithm.