Answer:
A. zero
Step-by-step explanation:
cuz the graphs are not intersecting anywhere. in order for their to be a solution. the graphs must intersect
B.13.1 that’s the answer
(:
Answer:
Permutation is used.
No. of arrangements = 1260
Step-by-step explanation:
Permutation is used for choosing & arrangement of 'r' out of 'n' objects, when sequence is important.
Total no. of alphabets in CORRECT = 7
C is repeated twice, R is repeated twice
So, Total No. of arrangements = <u>7 !</u>
(2!)(2!)
= 5040 / 4
= 1260
Answer:0.68
Step-by-step explanation: 0
+0.6
+0.08
