Level:
Project ID:
9000148902
Source Problem:
Accepted:
1
Clonable:
1
Easy:
0
There are four paths from a city to the top of nearby mountain. Find the number of
possible treks from the city to the mountain and back, if it is required to use one
path up and another one down.
\(4\cdot 3=12\)
\(4\cdot 4=16\)
\(4 + 3=7\)
\(2\cdot 4=8\)