This document contains two multi-part questions related to dynamic programming and queuing theory. The first question asks about the essential characteristics of dynamic programming problems and how a problem is solved using dynamic programming. The second question provides a linear programming problem and asks it to be solved using a dynamic programming approach. The third question provides details about a queuing system with three typists and asks about the fraction of time the typists will be busy, the average number of letters waiting, the average wait and processing time for a letter, and the probability a letter will take over 20 minutes. The final question provides details about a barber shop queuing system and asks for the calculation of several queuing theory