Q1. Suppose you have an algorithm where the efficiency function is T(n)=1/8 n² , where n is the size of an input. Suppose you have an old computer and replace it with a newer one. The new computer...

Correct and detailed answer will be Upvoted else downvoted. Thank you!

Extracted text: Q1. Suppose you have an algorithm where the efficiency function is T(n)=1/8 n² , where n is the size of an input. Suppose you have an old computer and replace it with a newer one. The new computer executes an operation 1000 times faster than older. Suppose you have t minutes to complete execution of an input. Can you estimate by what factor the new computer will increase the sizes of the input solved in the same amount of time as the old computer?