There are streets to be named after tree types. Birch, Cedar, Elm, Fir, Maple, Oak, Pine, Spruce, and Willow.
A city planner randomly selects the street names from the list of tree types.
Compute the probability of each of the following events.

Event A: The first street is Willow, followed by Oak and then Maple.

Event B: The first three streets are Birch, Maple, and Pine, without regard to order.

Write your answers as fractions in the simplest form.

i dont know if you cant find a way its best to actually add all of them start from 105 tho

step-by-step explanation:

b: |12 – x| ≤ 0.25

step-by-step explanation:      

let x be the possible lengths in inches, of the ribbons jaime cut.

we have been given that jaime is cutting strips of ribbon for a project. he tries to cut each piece to be 12 inches long, but sometimes he cuts it too long or too short by as much as 0.25 inch.  

we can represent this information in an inequality as:

by the definition of absolute value function we will get,

upon combining our inequalities we will get,

therefore, the inequality   describes all the possible lengths (x), in inches, of the ribbons jaime cut.

step-by-step explanation: