A dog rescue organization is working with 3 shelters, and has 5 volunteers that can help. The number of dogs saved from each shelter depends on how many of the volunteers are assigned to working with a shelter, and is given in the table below. Shelter A Shelter B Shelter C 8. Assume that each volunteer is assigned to a unique shelter. If a shelter is assigned less than 2 volunteers then no dogs can be saved. The rescue group wishes to maximize the number of dogs it can save. To solve the problem using Dynamic Programming define fi(s) = the maximum dogs saved stages i and above and state 2 volunteers 3 volunteers 4 volunteers 5 volunteers 2 6 8 13 1 2 10 20 2 4 5 9 (a.) What are the stages? (b.) What are the states? (c.) Solve the problem. Make sure to state at the end how many hours are spent studying for each exam. (A solution by guessing will get no credit, show your computations using fi(s) with the stages and states you Ad defined.) Go