1. (6 p.) Apply insertion-sort to sort the list A, L,G,O,R,LT,H,M.S in alphabetical order as described in class. 2(6 p.) Apply the source removal algorithm to solve the topological sorting problem for the following digraph. Resolve ties alphabetically 3. (8 p.) Consider the following sorted array 10 13 12 70 12 21 83 91 (a) What is the largest number of comparisons made by the binary search algorithm in searching for a key in the array? (b) List the keys of this array that will require the largest number of key comparisons when searched for by binary search. (c) Find the average number of comparisons made by the binary search algorithm in successful search in the array