Hi i need help some of the questions. Make sure you read the instructions before answering each question. And I want it to be typed up. Please do not handwritten it. I want it to be typed up. And please do all the problems that I assign. If you do not do all the problem that I assign. If you don't do all the problems that I assign then do not mind answering the question. Becuse I am running out of questions and my homework is going to be due tomorrow. So I need all the questions answered that I assign to you. And please give me a little explanation how you arrived with your answer. Thank you. I need help with question 4 letters A AND B. And question number 8 letters A,B AND C.

I need help with question 4 letters A,B,C AND ALSO D

With data types and data structures I need help with question 4 and with abstract data type I need help with questions 2 and 3. Please make your answer short. Do not make your answer long. Try to make it short.

Thank you very much, I appreciate it

a) Suppose that it takes 0.004 seconds to run a program on a te sot of size n 20o. Assume that the number of items in the actual da t sot is 4000 , "hat would be the oxpec ted run-time (show your work) if the program is applied to the actual data set and the under lying algorithn ist 5 Assume that it takes 0.0012 seconds to run a program on a teot data of size n = 50 Assume that the number of items in the actual ata set is 80,000. What would be the expooted run-time (show your work) if the proor am is applied to the actual data set and the underlying algor ithm isi a. OCn) b. o(n) 6. Assume that an algorithm consists of two parte, one part is on and the other i o(n). What is the 8ig-0 run-time for the entire algorithm ? 7. The Paradox of Speed: Suppose that computers become 16 times faster. If the same amount of computer time is to be used, how mch can the data set size be increased if the underlying algorithm is: 2 a. O( n) b. o(n ) e. Determine the answer and explain why it is the answer: a. O( n) ( n) b. O( n) +O(n c. O log n) o(n) ? 2