7. find -101 div 13, and -101 mod 13. 6 pts. 13-101 77 10 -101 - 13-8)t- 3 so,-101 div (3= -101 mod 13 and 8. use the euclidean algorithm to find the gcd (1001, 1331). (43 thoo 4 pts. 1331 1001t330 o01 830%0 330-4g0g aco(1001, 4tigo use the result of 8 to write the gcd (1001, 1331) 9. and 1331. as a linear combination of 1001 5 pts. phese tme process see fhe class notes 5 lo

answer: i don't understand it

step-by-step explanation: sorry

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.

its adding 5.5 each time

step-by-step explanation:

srry ask agian

step-by-step explanation: