The answer is C; 35.5 units^2
Answer:
15 foot
Step-by-step explanation:
6 foot = 8 foot shadow
3 foot= 4 foot shadow
15 foot=20 foot shadow
please give me brainliest!!!
Answer:
a) 7/5
Step-by-step explanation:

9514 1404 393
Answer:
- ABHGEFDCA
- does not exist
- ECBADFE
Step-by-step explanation:
A Hamiltonian circuit visits each node once and returns to its start. There is no simple way to determine if such a circuit exists.
__
For graph 2, if there were a circuit, paths ACB, ADB, and AEB would all have to be on it. Inclusion of all of those requires visiting nodes A and B more than once, so the circuit cannot exist.
__
For graph 3, the circuit must include paths BAD and DFE. That only leaves node C, which can be reached from both nodes B and E, so path ECB completes the circuit.