The number of crimes of each of a city's three police precincts depends on the number of patrol cars assigned to each precinct (see table below). For example, if 3 patrol cars are assigned to Precinct 2 the number of crimes in Precinct 2 will be 14. Seven patrol cars are available and at least one should be assigned to each precinct. Use dynamic programming to determine how many patrol cars should be allocated to each precinct to minimize the total number of crimes in the city. Number of patrol cars assigned to precinct 1 2 3 4 5 Precinct 1 12 10 8 5 3 Precinct 2 19 17 14 12 11 Precinct 3 14 11 8 6 5 a) Formulate the problem by defining stages, decision variables, states, state transformation and recursive relationship. b) Solve the problem using stage tables. Find the optimal policy. If more than one, find them all.