First of all, find how many sentences are in 17 pages. If in one page there are 120 sentences, in 17...
17*120 = 2040 sentences.
Now, she can read 14 sentences in one minute, how many minutes to read 2040 sentences?
2040 : 14 = 145,71 minutes (about 146 mins).
So, in an hour there are 60 minutes
146 : 60 = 2,42 hours (about 2,5)
But you can also convert 145,71 mins = 2 hours and 25 mins.
Answer:
An architect is a person who works by the acts of planning, designing, and having control/monitoring the construction of buildings.
Explanation:
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.
You need to have the story you chose available to the rest of us. Also, Do you actually need help with this?