explain step by step . I really appreciate for your help. Synopsis: Utilizing the time complexity formulae on the introduced concepts: divide-and-conquer, heap, and etc.

• Keywords: Big-O, Big-Theta, Big-Omega, Asymptotic Notations
• Format requirements: You may either type in your solutions or write them down on paper. You are more than welcome to use Latex for better equation formatting. For those who write on paper, you will need to photo-scan your answer sheets and upload them to Canvas in a single composite PDF file. YouDO NOT need to duplicate the question texts while answering. Simply use notations like Part 1A,orPart 3B to refer to each question in your answer sheet. 

Transcribed Image Text:

PART 1 - Observing the loops (3+3 pts) Find the Big- notations for the following pseudocode snippets with regard to n (the size of data). Please note, you must show us how to find both the upper bound and the lower bound, or you will get zero points. You may also use the l'Hopital's trick for your convenience. A. // Assuming n is always larger than 10 for (k = 0; k = n) ; PART 1 - Observing the loops (3+3 pts) Find the Big- notations for the following pseudocode snippets with regard to n (the size of data). Please note, you must show us how to find both the upper bound and the lower bound, or you will get zero points. You may also use the l'Hopital's trick for your convenience. A. // Assuming n is always larger than 10 for (k = 0; k = n) ;