Consider the following situation:

Mount Azteca is $1\mathrm{.}3km$ high. There are $3$ different trails from the starting place at the bottom to the top of the $r$ One trail is $4\mathrm{.}5km$ long, another is $3\mathrm{.}5km$ long, and the most difficult is $2\mathrm{.}4km$ long.

For each of the following computations, finish the story problem previously started so that the problem could lead $t$ computation described. As always, it may be helpful to make a drawing of the situation and think about the quantiti