Problem #1 (20 points) Consider the points (0, 0) and (7, 9) in the my plane and suppose in traveling from (0, 0) to (7, 9), only the steps R (my) * (I +1,y) and U: (mug) * (any + 1) are allowed. a.) (3 points) Compute the total number of possible paths from (0,0) to (7,9) using only the steps R (to the right) and U (up). b.) (7 points) Compute the total number of possible paths from (0, 0) to (7, 9) using only the steps R (to the right) and U (up) if the subpath (3,4) a (4,4) a (4,5) a (4,6) a (5, 6) is not allowed. (1.) (10 points) Compute the total number of possible paths from (0,0) to (7, 9) if the steps R (to the right) and U (up) are allowed, along with the diagonal step D: (23,90 > (m+ 1,y+1)