2. (25 pts, 5 pts each) Mark by T(=true) or F(=false) each of the following: can, (1) (5 pts) If algorithm A solves problem L in O(n log n) time, then no instance of problem L when given to A as input, makes A take n time. (2) (5 pts) Quicksort is a stable sorting. (3) (5 pts) Hoares partition has a better average-performance than Lomutos partition. (4) (5 pts) Suppose problem P can be reduced to problem P2 in linear time (i.e., P XO(n) P2). Then, if there exists a polynomial time algorithm for P, there there exists a polynomial time algorithm for P2. (5) (5 pts) Let T be an MST (minimum spanning tree) of graph G. Given a connected subgraph H of G, Tn H is contained in some MST of H