PYTHON: Consider the following problem: A city council has placed 360-degree cameras to monitor activity at a selection of locations (car parks, bus stations, etc.) across the city. Solve the problem...

PYTHON:

Consider the following problem:

A city council has placed 360-degree cameras to monitor activity at a selection of locations (car parks, bus stations, etc.) across the city. Solve the problem of finding the smallest set of locations where to place cameras so that each location either has a camera or is at most 25 metres from a camera.

A.

Sketch an algorithm (don't write code) to solve the original problem, by generating all subsets of locations and for each subset checking if putting cameras at those locations will cover all locations.
Your algorithm does not need to specify how the subsets are generated.
Your algorithm can use the 'full coverage' function.
The solution should be the smallest subset that covers all locations.

B

Analyse the worst-case complexity of your algorithm.