Three circular streets intersect at points a, b, c, d, e, and f as shown. How many different paths can be walked along the streets from a to f, if no intersection is entered more than once when walking each path?

i dont know

step-by-step explanation:

i did it myself and i got 4.2 (b) hope its right

step-by-step explanation:

his first public project he is asked to create a small scale drawing. the garden is a right triangle with base 25m and height 30m. are you trying to solve for the last side/hypotenuse? the irrational form of the answer would be 5\sqrt{61}