A fourth-year engineering student is seeking part-time jobs to get work experience and financial income. The student can set aside 300 hours for the planning period in which she wants to work. As a consequence of the interviews, the student received four employment offers. These works are composed of multiple tasks. She can choose to work for any number of tasks of one or more works. In the table below, required time the student should spend on each of these tasks, the number of tasks she may do for each of these works, and the earnings she will get if she accomplishes each task once are given. Work Type # of tasks Required time per task (hrs) 100 A B D 50 Fee per Task (Dollarx 100) 20 10 7 3 2 2 4 3 30 20 a. The student wants to find out which work(s) to select and number tasks she will do in order to earn the most amount of money. Formulate a dynamic programming recursion that maximizes the student's total earnings from their work selection decisions (Define State, Stage, Decision, Recursion formula, and Solution procedure). And solve the model manually. b. What would be the solution if she only has 200 hours to devote to these works