Textbook: Introduction to Algorithms (3rd edition) by T. Cormen, C. Leiserson, R. Rivest and C. Stein, MIT Press, 2009 Possible Chapters: 4.2 (Strassen's algorithm), 6 (Heapsort) , 7 (Quicksort), 22 (Graph Algorithms), 23 (Minimum Spanning Trees)

Show all work (if necessary).

Only do part (B).

2. a) Using Figure 7.1 in CLRS as a model, illustrate the operation of PARTITION on the array A- (9,5,2,6,3,4 Solution. Your solution here. 1 2 5 3 b) Use Strassen's algorithm to compute the matrix product () ( Give the intermediate steps with respect to each and x operation. How inany operations are there? How many operations are there? Solution. Your solution here