A sales representative who lives in city A wishes to start from home and visit 7 different cities: cities B, C, D, E, F, G, and H. She must choose either to drive her own car, take trains, take buses, take boats, or fly. If all cities are interconnected by roads, railways, bus routes, waterways, and airlines, how many travel plans can be constructed to visit each city exactly once and return home?

according to egenuity the answer is

step-by-step explanation:

d. 344.22

imma say 16%. sorry if its wrong. i'm doing the same stuff right now

step-by-step explanation:

region b will make the inequalities y < 2x + 1 and y > -x - 2 true ⇒ answer a

step-by-step explanation:

* lets study the graph and the inequality to solve the question

- the inequality y > -x - 2

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = -2 that means the line intersect the y-axis at point (0 , -2)

∵ the sign of the inequality is >

∴ we shad the part over the line

  region a and b

- the inequality y < 2x + 1

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = 1 that means the line intersect the y-axis at point (0 , 1)

∵ the sign of the inequality is <

∴ we shad the part under the line

  region b and c

∵ the common region between the two lines is region b

∴ region b will make the inequalities y < 2x + 1 and y > -x - 2 true