Suppose that g = (v, e) is a directed graph. a vertex w ∈ v is reachable from a vertex v ∈ v if there is a directed path from v to w. the vertices v and w are mutually reachable if there are both a directed path from v to w and a directed path from w to v in g.

show that { (u, v) | u and v are mutually reachable in directed graph g = (v, e) } is an equivalence relation (i. e., reflexive, symmetric, and transitive).

about 0.75 hours

step-by-step explanation:

second option

step-by-step explanation:

the measures of a triangle equal 180. use that to find x.

2x+3x+4x=180

9x=180

9x/9=180/9

x=20

now you know x, you know angle a is 40°, angle b is 60°, angle c is 80°.

because angle a is 40°, the first option doesn't work.

because angle b is 60°, the second option does work.

when you add angle a and b, you get 100°. complementary means it equals 90°, so the third option doesn't work.

when you add angle a and c, you get 120°, which is not 100.

answer:   35 % is the probability of a late departure or an early arrival.

step-by-step explanation:

let l represents the late departure and e represents the early departure.

then, according to the question,

p(l) = 12 %,   p(e) = 27 % and = 4 %

and, we have to find out,

but, we know that,

which is the required equation that will use to find the probability of a late departure or an early departure.

therefore,   the probability of a late departure or an early arrival =   35 %