8.(5.5 in the ry-plane we want to go from a(0,0) to b(9,6) along the lines of the form z = i and y = j are integers with the shortest paths. let c(3,3 and d(4,3 (i, j (1) how many ways are there? (2) how many ways are there via d? (3) how many ways are there if the road from c to d is closed?

9 sandwiches per hour

step-by-step explanation:

when we have a rate, we want a 1 in the denominator

27/3 = 9

27 sandwiches/ 3 hours = 9 sandwiches/hour

ranks (& how to earn them):

-beginner (needs at least 0 points & 0 brainliest answers)

- hand (needs at least 100 points & 0 brainliest answers)

-ambitious   (needs at least 250 points & 0 brainliest answers)

-virtuoso (needs at least 500 points & 5 brainliest answers)

-expert   (needs at least 1,000 points & 10 brainliest answers)

-ace (needs at least 3,000 points & 15 brainliest answers)

-genius   (needs at least 15,000 points & 50 brainliest answers)

how to award brainliest:

you must wait until 2 people answer to award brainliest. i'm pretty sure that it should be next to the "" and "comments" buttons.