During month t(t  1, 2, . . . , 60), expert safecracker Dirk Stack knows that he will be offered a role in a bank job that will pay him dt dollars. There is, however, a probability pt that month t’s job will result in his capture. If Dirk is captured, all his money will be lost. Dirk’s goal is to maximize his expected asset position at the end of month 60. Formulate a dynamic programming recursion that will help Dirk accomplish his goal. At the beginning of month 1, Dirk has $50,000