You can only walk through a door once. Walking through a door closes it. Close all the doors.

  not possible

Step-by-step explanation:

If we place the node of a graph in each space, the 5 rooms constitute 5 nodes, and the "outdoor" space constitutes a 6th node. There are 3 rooms with 5 doors each, and "outdoors" connects to "indoors" via 9 doors.

Hence, there are 4 nodes with an odd number of doors. The path you seek is called an Eulerian path. It is only possible if the number of odd nodes is 0 or 2.

No such path is possible.

b

step-by-step explanation:

given

- 2 (3x + 12y - 5 - 17x - 16y + 4 )

simplify the parenthesis by collecting like terms

= - 2 (- 14x - 4y - 1) ← distribute the parenthesis by - 2

= 28x + 8y + 2 → b

x = 12

y = 15

step-by-step explanation: