Emma is choosing a weekly meeting time. She hopes to have two different
managers attend on a regular basis. The table shows the probabilities that
the managers can attend on the days she is proposing.
Monday
Wednesday
Manager A
0.91
0.71
Manager B
0.77
0.93
Assuming that manager A's availability is independent of manager B's
availability, which day should Emma choose to maximize the probability that
both managers will be available?
A. Wednesday. The probability that both managers will be available is
0.93
O
B. Monday. The probability that both managers will be available is
0.91
O
C. Monday. The probability that both managers will be available is
0.7.
D. Wednesday. The probability that both managers will be available is
0.66

4.6875 pounds

step-by-step explanation:

d, x=8

step-by-step explanation:

simplifying

4x + -5 = 2x + 11

reorder the terms:

-5 + 4x = 2x + 11

reorder the terms:

-5 + 4x = 11 + 2x

solving

-5 + 4x = 11 + 2x

solving for variable 'x'.

move all terms containing x to the left, all other terms to the right.

add '-2x' to each side of the equation.

-5 + 4x + -2x = 11 + 2x + -2x

combine like terms: 4x + -2x = 2x

-5 + 2x = 11 + 2x + -2x

combine like terms: 2x + -2x = 0

-5 + 2x = 11 + 0

-5 + 2x = 11

add '5' to each side of the equation.

-5 + 5 + 2x = 11 + 5

combine like terms: -5 + 5 = 0

0 + 2x = 11 + 5

2x = 11 + 5

combine like terms: 11 + 5 = 16

2x = 16

divide each side by '2'.

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."