P3 (10 points) (Stair climbing with gain) The jump sizes below have the given gain (e.g. health points). You can assume that any other jump size is allowed, but has 0 health points. Jump size: 4 6 10 12 Gain (Health points): 10 2133 36 a) (7 points) Fill out the solution array, sol, using bottom-up dynamic programming. Follow the style we did in class: for each work-out box (in rows for jump sizes 4,6,10,12) show the remaining stairs and the optimal value obtained by using that jump size Fill-out all the table (starting from 0) 0 1 23 4 5 6 7 89 10 11 12 Sol: Picked 4 6 10 12 b) G points) Use the table above to recover h jums that achieve the optimal value for 12sais. P3 (10 points) (Stair climbing with gain) The jump sizes below have the given gain (e.g. health points). You can assume that any other jump size is allowed, but has 0 health points. Jump size: 4 6 10 12 Gain (Health points): 10 2133 36 a) (7 points) Fill out the solution array, sol, using bottom-up dynamic programming. Follow the style we did in class: for each work-out box (in rows for jump sizes 4,6,10,12) show the remaining stairs and the optimal value obtained by using that jump size Fill-out all the table (starting from 0) 0 1 23 4 5 6 7 89 10 11 12 Sol: Picked 4 6 10 12 b) G points) Use the table above to recover h jums that achieve the optimal value for 12sais