> For the complete documentation index, see [llms.txt](https://computational-thinking-in-room11.gitbook.io/room-112-dhs/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://computational-thinking-in-room11.gitbook.io/room-112-dhs/problemsolving/problem-1.md).

# Problem  1

You may work with ONE other person but both of you should turn in complete work

Somewhere in the Sonoran desert in Arizona, the  US Army set up training camps named Muskrat, Poodle, Weasel, Hornbill, Raven, and Jaguar.

![](https://2507214486-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LpUPSf3tCxHePJxNjfg%2F-Ly4d6-pEneUlj-r0CSK%2F-Ly4da9p_V6M_7pvWIbW%2Fda2eknk-5920bd36-ce57-4a7d-b85c-5b87b0dce5aa.gif?alt=media\&token=fa7709cc-a354-4475-95d4-d84ac06af5e6)

Pairs of camps are connected by roads (not always straight) as follows

* Muskrat is 15 miles from Weasel
* Raven is 12 miles from Hornbill
* Poodle is 6 miles from Jaguar
* Hornbill is 3 miles from Weasel
* Raven is 9 miles from Jaguar
* Raven is 7 miles Weasel
* Jaguar is 1 mile from Muskrat
* Poodle is 11 miles from Hornbill

No other roads exist between camps

Draw a diagram of the desert camps(it does NOT have to be to scale) and label  the camps and  the length of the roads

Answer each question - indicate total mileage of the trip and  and the route the jeeps need to take. For each pair - what is the shortest (or most  efficient) route

* [ ] Poodle  to Raven
* [ ] Hornbill to Jaguar
* [ ] Weasel to Poodle
* [ ] Muskrat to Hornbill
* [ ] Weasel to  Jaguar
* [ ] Hornbill to  Raven
* [ ] Muskrat to Poodle

When you are finished fold it like a hotdog and write your name on the outside.

![](https://2507214486-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LpUPSf3tCxHePJxNjfg%2F-Ly4dgIDCGmsjvkmxeyZ%2F-Ly4dyyLCtYMzve7ByXM%2Fimage.png?alt=media\&token=ea50a920-5c75-426b-a3bc-61bb5b3a8524)