Answer:
D
Explanation:
To know which is most or least cost-effective, it's not enough to look at only the per day rate, or only the time to complete. You have to multiply them to get the total cost of the project.
![\left[\begin{array}{ccccc}&Cost\ per\ day\ (\$)&Time\ to\ complete\ (days)&Total\ cost\ (\$)\\Zoe&500&8&4000\\Greg&650&10&6500\\Orion&400&12&4800\\Jin&700&5&3500\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccccc%7D%26Cost%5C%20per%5C%20day%5C%20%28%5C%24%29%26Time%5C%20to%5C%20complete%5C%20%28days%29%26Total%5C%20cost%5C%20%28%5C%24%29%5C%5CZoe%26500%268%264000%5C%5CGreg%26650%2610%266500%5C%5COrion%26400%2612%264800%5C%5CJin%26700%265%263500%5Cend%7Barray%7D%5Cright%5D)
As you can see, Greg is the least cost-effective because he charges the most for the project.
You can find air pods that look real on letgo. or you can go to wish.com but if you want a good pair jus get the real ones
Answer:
note:
<u>solution is attached in word form due to error in mathematical equation. furthermore i also attach Screenshot of solution in word due to different version of MS Office please find the attachment</u>
Answer:
At the point when the quantity of bit strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just part strings to processors and not client level strings to processors. At the point when the quantity of part strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used all the while. Be that as it may, when a part string obstructs inside the portion (because of a page flaw or while summoning framework calls), the comparing processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, in this way expanding the use of the multiprocessor system.When the quantity of part strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just bit strings to processors and not client level strings to processors. At the point when the quantity of bit strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used at the same time. Be that as it may, when a part string hinders inside the piece (because of a page flaw or while summoning framework calls), the relating processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, along these lines expanding the usage of the multiprocessor framework.
