6 and 7

A.) I-I-F-D-B-K-H-G-C-A B.)I-J-D-F-B-K-G-H-C-A C.)A-B-D-I-J-F-C-G-K-H D.)I-D-J-B-F-A-G-K-C- H Set up a recurrence relation for the number of key comparisons made by Mergesort algorithm on best case inputs and solve this recurrence relation for n-2k using backward substitution method i) Construct an AVL tree for the following list: Y, U, L, F, G, C, V, P, K, O (Use alphabetical order of the letters and insert them successively starting with the empty tree). Clearly show all the steps. i naiyze the efficiency of bottom-up heap construction algorithm in the worst case 6. 7. 2+1 8. Compute 112 21 by applying the divide-and-conquer algorithm for large-integer multiplication. 2 Clearly show all the steps cedure of Boyer-Moore string matching algorithm. Trace the same to search for 9 Write the a patter?: GID the text