Suppose the matrix R represents a railroad map between cities 1, 2, 3, 4, and 5. How many different ways can you travel from city 1 to city 3 with exactly 1 connection

How many different ways can you travel from city 2 to city 5 with exactly one
connection?

answer:

step-by-step explanation:

here, the total dishes = 10

dishes having meat = 3 ( chicken, meatloaf and hamburger )

thus, the probability of having meat on the chosen dishes = number of dishes having meat / total dishes

=

therefore, the probability of not having meat = 1- the probability of having meat on the chosen dishes

=

=

=

⇒ option b is correct.

answer:   28.56 feet (approx)

step-by-step explanation:

since, triangle abc has measure of angle c equal to 55 degrees, measure of angle abc equal to 90 degrees, and length of bc equal to 20 feet.

we have to find out the measurement of segment ab.

therefore, tan 55° =

but bc = 20 feet.

⇒ tan 55 ° =  

⇒ ab = 20 × tan 55 °

⇒ ab = 20 × 1.42814800674

⇒ ab = 28.5629601348   ≈ 28.56 feet

jwjeh; hw; kjhekjhkjhwkejhkw

step-by-step explanation: