Tree diagram: Emily has a box with 4 different colored tiles: one red, one green, one blue and one yellow. If he draws one of the pieces without looking, what is the probability of drawing the green before the red?

Step-by-step explanation:

Given: Emily has a box with 4 different colored tiles: one red, one green, one blue and one yellow.

We assume that repetition is not allowed

Total number of ways to draw two tiles =  [By permuattaions]

Favourable outcome = First green then red  (only one way)

So, the probability of drawing the green before the red

hence, the required probability =

answer: yes, since the line has a steeper rate of change than the exponential the y-values will be greater and they will only intersect one time.