a policeman has to patrol along the streets of the subdivision represented by the following graph. he wants to start his trip at the police station (located at x) and end the trip at his home (located at e). he needs to cover each block of the subdivision at least once and at the same time he wants to duplicate the fewest possible number of blocks. find an optimal eulerization of the graph (add the fewest number of edges to have the desired euler path.

step-by-step explanation:

always plug in x. in this case, x equals 4.

i'm going to first solve 4(2+3x)

1) 4(2+3(4)) use pemdas to solve.

i'm going to multiply whats in the parenthesis first, so 3 times 4=12.

2)4 (2+12) i'm then going to multiply 4 by both numbers in the parenthesis (because multiplying comes before adding)

4 times 2= 8.   4 times 12= 48

4) (8+48)= 56 (answer)

i'm then going to solve 8+12x and plug in 4 for x.

1) 8 +12(4)

multiplying comes before adding, so i'm gonna multiply 12 and 4.

12 times 4= 48.

2) 8+48=56

both equal the same!

step-by-step explanation:

answer

false

explanation

these practices describe the manner the land use outcome is attained. land management methods implemented by corporations are a mandatory because they are a driver for better land use results economically, socially and environmentally. corporations are required to understand the connection between land use , and land management practices to support sustainable land use policies

no solution

step-by-step explanation:

there is not enough information in the problem to solve.