1. Show that the bound of n/3 for the art gallery problem is tight; that is, design a n-vertex polygon so that it requires close to n/3 cameras.

2. Generalize the argument seen in class for the sum of a geometric progression with first term 1 and ratio r, assuming r is a natural number.