The optimum off-line strategy for static dictionaries (no insert/delete) on sequential linear lists with free paid exchanges is a. the Work Function heuristic which is based on dynamic programming. b. the Move-to-Front heuristic. c. to keep the list items in non-increasing order of access frequencies. d. None of the other choices. How efficiently can a Skew Heap be converted into a Binomial Heap and vite versa? 1. Given a Skew Heap H, construct a Binomial Heap H' that contains the same set of items as the input heap H. As a result, the algorithm may destroy the input heap. What is the running time T (n) as a function of the input size n = [H ? 2. Given a Binomial Heap H, construct a Skew Heap H' that contains the same set of items as the input heap H. As a result, the algorithm may destroy the input heap. What is the running time T2(n) as a function of the input size n = |HI ? a. Ti(n) = 001) and T (1) = 0 (n log.n). b. Tin) = 0 log n) and T (n) = O(n). c. Ti(n) = OG log n) and T200) = 001logn). d. Tn) = 0 and 701) = 0(n)