A city police department has the following minimal daily requirement for policeman. Note, you are to consider period 1 as following immediately after period 6. Each policeman works eight consecutive hours. Let X denote the number of officers starting work in period t every day. The police department seeks a daily manpower schedule that employs the least number of policemen, provided that each of the above requirements is met. Formulate linear programming model to find an optimal schedule.