Marvin the fly starts at $(0,0).$ Each step, Marvin moves one unit right or one unit up. He is trying to get to the point $(5,7)$. However, at $(4,3)$ there is a frog that will eat him if he goes through that point. In how many ways can Marvin reach $(5,7)$?

The answer is "728 routes"

Step-by-step explanation:

The number of ways to proceed from (0, 0) to (5, 7) is as follows:

We would like to delete the ways of (0, 0) to (2, 3)  That's the resolution:

step-by-step explanation:

wrgasadvauoyfaiua-00uhf

start with a line segment pq that we will copy. mark a point r that will be one endpoint of the new line segment. set the compasses' point on the point p of the line segment to be copied. adjust the compasses' width to the point q. the compasses' width is now equal to the length of the line segment pq.

step-by-step explanation: