Please write 4-5 sentences about what you see in this image. Include what you think happened after the photograph was taken.

English

1 answer:

lilavasa [31]2 years ago

4 0

Answer:

I see woods in this image. After this photograph was taken the train crashed?

You might be interested in

Every second, 1 hectare of the world`s rainforest is destroyed. That`s equivalent to two football fields. An area the size of Ne

blagie [28]

In the world’s rainforest, nearly 1 hectare is destroyed per second. This adds up to nearly 31 million hectares per year; the size bigger than Poland. As a result, the environment is being damaged: 137 species of wildlife are becoming extinct per year. Humans are benefiting from this destruction by making a profit off logging and making cheap products.

3 0

3 years ago

Which event from The Odyssey best highlights the idea that the ancient Greeks greatly disliked greediness?

igomit [66]

<span>The Slaying of the Suitors is the event from the Odyssey which best highlights that the Ancient Greeks greatly disliked greediness. In Odysseus’ absence, suitors had been trying to court his wife, Penelope, for access to Odysseus’ wealth and lands. However, Odysseus and his son Telemachus kill all the suitors when Odysseus returns.</span>

8 0

2 years ago

Given a non-empty string s and a dictionary containing a list of unique words, design a dynamic programming algorithm to determi

nlexa [21]

Let s(i),k denote the substring s(i)s(i+1)...s k. Let Opt(k) denote whether the sub-string s1,k can be segmented using the words in the dictionary, namely (k) =1 if the segmentation is possible and 0 otherwise. A segmentation of this sub-string s1,k is possible if only the last word (say si k) is in the dictionary theremaining substring s1,i can be segmented.
Therefore, we have equation:Opt(k) = max Opt(i) 0<i<k and s(i+1),kis a word in the dictionary
We can begin solving the above recurrence with the initial condition that Opt(0) =1 and then go on to comput eOpt(k) for k= 1, 2. The answer correspond-ing to Opt(n) is the solution and can be computed in Θ(n2) time.