What is omega notation and how is it different from big O notation? What is little o notation and how is it different from big O notation? Question 3.4 from the book: a. Write each of the following running times as a big O order: i. 13n-2n + 56 ii. 2.5 log n +2 ii. n * (12 + log n) v. log n210 vi. log n2n log n Question 3.7 from the book: a. An algorithm prints the following pattern at i. What are the basic operations performed by the algorithm that you would count toward its running time? ii. Count the number of these basic operations ii. The number of lines printed in the preceding pattern is five. Assume that the algorithm can extend this pattern for any number of lines (line number k has k stars). If the number of lines, n, is an input to the algorithm, how many basic operations are performed as a function of n? iv. Write you answer to the above question as a big O order