Each year, the owner of a lake must determine how many bass to capture and sell. During year t, a price pt will be received for each bass that is caught. If the lake contains b bass at the beginning of year t, the cost of capturing x bass is ct (x|b). Between the time that year t’s bass are caught and year t  1 begins, the bass in the lake multiply by a random factor D, where P(D 

d)  q(d).

Formulate a dynamic programming recursion that can be used to determine a basscatching strategy that will maximize the owner’s net profit over the next ten years. At present, the lake contains 10,000 bass