Given a set ={1,2,…,} of tasks, where requires pp units of processing time to finish once it has started. There is only one computer to run these tasks one at a time. Let cc be the completion time of task The goal is to minimize the average completion time 1 ∑ c =1 . For example, two tasks 1 and 2 have processing times p1= 3 and p2 = 5 respectively; running 1first results in the average completion time (3 + 8)/2 = 5.5, while running 2 first results in the average completion time (5 + 8)/2 = 6.5. (1) Describe the greedy choice property and the optimal substructure in this problem, (2) Design a greedy algorithm to solve this problem, (3) Analyze the complexity of your algorithm.

i would first let him be aware that a cover letter is official and confidential and it requires a proper formatting so that the employer doesn't have hard time when going through it. he should write it in paragraphs of about two to four sentences and use proper grammar a , spelling and proper punctuation. i will also advice him not to be emotional and not also to use images.then base his attention to the details of the job described and not other things. that is he be specific to the responsibilities and to the employers requirements. on this he should make sure that the letter reflects how good he is for the requirements detailed by the employer

the letter should not be too long nor too short.