(5 pts) A city planning engineer would like to determine the minimum number of security cameras it would take to cover all streets in a high-profile area. The cameras will be placed at some corners so that every street is covered. A street is covered if there is a camera at either end of the street. An example of such a network of streets is shown below. a. (3 pts) Describe a model of the city to solve this problem. What graph problem can be used to solve this problem? For the example below, what is the minimum number of needed cameras? b. (2 pts) Provide two different examples of neighborhood areas for which two cameras will be enough to cover all streets. Provide an example for which at least three cameras are needed. A B