Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009

Show all work (if necessary).

2. Fill the following blanks with the notations O, o, , w, or . Use o if both O and o are applicable. Use w if both and w are applicable. Use if both and O are applicable. To distinguish O and o, write "big-O" for O (2 log n) (n2) (2n) a) n= b) 0.2n_ c) 2n= d) 2n log n = (n6) Solution. Your solution here