a. [ t f ] A graph G = (V. E) with E-M-1 is a tree. b.t f Merge sort is an 'in-place' sorting algorithm c.[ t f ]In worst case, Mergesort runs asymptotically faster than Quicksort d, [ t f ] In worst case, Counting Sort can be forced to run (n3) by choosing suitable iput data. e. t f There is a good greedy algorithm for the fractional Knapsack Problem. f. t f In an undirected graph, cross edges returned by DFS indicate cycles g.t f If the comparator input wires of a comparison network have depth d and dy, than the comparator output wires have depth min(dr, dy)+1. h. [ t f Johnsons' algorithm solves the APSP Problem asymptotically faster than Dijkstra (using a Fibonacci Heap) applied to every vertex. i. [ t f ] Huffman codes are an example of a greedy algorithm j. t f] Radix sort is stable. k t f ] In worst case, R-Select runs in (n). 1.[ t fIn worst case, Strassen's fast matrix multiplication algorithm runs in (nlog72)