the dynamic recursion, and solve using paper/pen/calculator or Matlab or Excel or any other software. 1) A bakery has 12 trained bakers. Each month new bakers are hired at the start of the month, but none are fired. Training of a new baker takes 1 month, and each trainee needs 1 trained baker to spend 0.5 month acting as a supervisor rather than making bread. A trainee made bread cannot be sold. Each month some d number of trained bakers are needed as below. 1,2,1,3,2 of trained bakers leave the job at the end of month 1, 2, 3, 4, 5 respectively but none of the trainees leave. The payroll cost for a trained baker is $2000/mo and for a trainee is $1200/month. Set up a DP formulation and solve to minimize payroll cost. Identify the states/stages, decision variable and its range, state transition function constraints, and the cost function clearly. At the end of month 6 the bakery is closed (all employees leave) 6 1 10 12 Month Trained bakers needed d the dynamic recursion, and solve using paper/pen/calculator or Matlab or Excel or any other software. 1) A bakery has 12 trained bakers. Each month new bakers are hired at the start of the month, but none are fired. Training of a new baker takes 1 month, and each trainee needs 1 trained baker to spend 0.5 month acting as a supervisor rather than making bread. A trainee made bread cannot be sold. Each month some d number of trained bakers are needed as below. 1,2,1,3,2 of trained bakers leave the job at the end of month 1, 2, 3, 4, 5 respectively but none of the trainees leave. The payroll cost for a trained baker is $2000/mo and for a trainee is $1200/month. Set up a DP formulation and solve to minimize payroll cost. Identify the states/stages, decision variable and its range, state transition function constraints, and the cost function clearly. At the end of month 6 the bakery is closed (all employees leave) 6 1 10 12 Month Trained bakers needed d