Divide and conquer

Dlemetation of the data structure such that Init(M) takes O(1) time and all other operations take O(log I MI) time. (b) Design an algorithm for sorting a list L in O(lL log ) tine using this data struc- ture. 5 Divide and Conquer A k-spanner on n nodes is a directed graph G (V, E) with V = {1, ,n), such that for every pair of nodes (i.j), where i