Consider functions f and g such that composite g of is defined and is one-one. Are f and g both necessarily one-one. Let f : A → B and g : B → C be two functions such that g o f : A ∴ C is defined. We are given that g of : A → C is one-one.
Spinning on Y out of three letters (G, I and Y) = 1/3
then either an easy or hard = 1/2
so
The probability that the spinner will stop on the letter Y and then easy
= 1/3 x 1/2
= 1/6
= 0.17
answer:
0.17
Answer:
n=10
Step-by-step explanation:
