1
Answer:
Erika solved her problem by activating memories from the past.
Explanation:
Erika is having problems with the Lego structure she is creating. She wants to solve this problem and for that reason, she starts to think about what could help her keep her structure stable, without collapsing.
At that moment, Erika, searched her memory, if she knew something that could help her, that's when she activated a memory from the past that showed that she watched a cartoon that showed something that could work. So, she managed to solve her problem.
Answer:
the level of development depends on how financially the area is for example in cities ,the level of development is high compared to villages
this is because in cities there are many financial assets like jobs,industries,markets and others
increase in population also increases the level of development because there is large market for produced goods ,I mean in some places where there are lots of people , there is increased development..since the government sets up modern roads,high quality buildings,and others..that differentiates low populated areas from high populated areas
in industrious areas,there is high development because people are employed and they improve infrastructure for example building houses and also roads are developed since they need to transfer goods from industries
Answer: They created Terraces into the mountainside
Explanation:
The Inca dug into the mountain side and created Terraces, which allowed them to filter water down the mountain side, as well as make a steeper ledge, since they did everything by hand, with hand made hoe's made out of branches and stones, they where able to till the ground to plant the seeds. The mountainside dirt was very enriched with minerals, which made it perfect land for farming.
Answer:
The answer is "Binary Search algorithm".
Explanation:
It is an accurate method, which is used to identify an object from the list of things, that has been sorted. It operates by splitting a section of the list.
- It includes the element twice into half, until after you have reduced all the potential targets to only one.
- This algorithm works with O(n * log(n)) efficiency, that's why it is used in the array sorting, it also consumes less time.
