Proofreading this assignment as I'm not very good at English.

English

1 answer:

Mariulka [41]2 years ago

4 0

Answer:

First line you need a comma after Mrs Gonzalez. First line capital letter to start ‘We’

First paragraph ‘new dimension of client service, office space and studios***.’ ‘Clients looking for new office facilities***.’ You need a comma after filing cabinets and lastly in the first paragraph you need to change ‘they is’ to ‘they are’. And a full stop at the end of that paragraph

Second paragraph. Needs to start with a capital letter ‘This’. ‘At no charge to you**comma**....’ ‘any offices you offer**comma**...AS this will be AN important sales aid that will pay off and help with increased sales efficiently.’ ‘Estate firms like yours ARE always looking for new...’

Last paragraph. ‘Happy to MEET’ ‘together’ is one word. ‘Have a client with office FURNISHING (change need to needed) and end with a full stop and then begin new sentence. We will prove that this service will work for you.

Explanation:

Glad to help if you need me to explain everything let me know. I’ve put spelling mistakes etc in capitals so it’s easy for you to see!

You might be interested in

Did someone wear purple in sherlock holmes the hound of the baskervilles

balandron [24]

Yes, The murder that escaped from prison was killed by falling and breaking his neck when being chased by the Hound. The main villain set the Hound on the murderer thinking he was Sir Henry, (the main victim.)

8 0

2 years ago

I'm teary-eyed but never cry. Silver-tongued, but never lie. Double-winged, but never fly. Air-cooled, but never dry. What am I?

ss7ja [257]

Mercury The Element looks shiny ,silver, and is wet. The god mercury has two wings but only uses them to run

8 0

2 years ago

Read 2 more answers

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.