Explain the idea of binary search algorithm for arrays. Explain why linked lists are not suitable data structures for implementing binary search. Consider the following items stored in an integer array: 2, 5, 21, 16, 11, 12, 8, 18, 6. Search for a key value of 16 in the above given array using linear and binary search methods, respectively. Underline the item that is being compared with the key value in each step. Arrange the string "great" in alphabetical order using selection sort. Show each step involved. Consider the incomplete C program given in Figure Q4 that is to automate the above sorting task. Based on the comments provided, complete the program