answer no2

Due Tuesday, February 7, at 7:00AM 10 points This qaiz will be a written quiz. Please submit your answers to these questions by uploading a file to Canvas. You may type or handwrite your solutions. You are free to use the textbook, slides, class notes, but DO NOT consult any other resources. There are five questions total (two of them on the second page) ( Question 1) [2 points] Is 2n+1=O(2n) ? No, the given statemens are not equal, since O notation represarts the upper bound on growet rate tunction and does not provide the exact value. The former expression grows much tasier. Question 2) [2 points] Is 22n=O(2n) ? Yes, as in this oise 222n is growing at same or slower rate than of O(2n), which implies farmer can be bounded wet latter and thus they are considered to be of the same order. Question 3) [2 points] Explain why the statement, The running time of algorithm A is at least O(n2)is meaningless. The notaton represents the upper bound of the aborithm and shows that the agonthm atmest could be slower to this extent Therefrore, it wal be meaningless to state that The tunning time of algorithm A is atioast O(n22 ) " To precisely provide the funning time ether represent ins tight bound or the exact formula of rurning