Describe an algorithm for binary search in a given sorted list. a. In English b. In Psudocode c. Compare binary search and linear (sequential) search Consider the sorting algorithm listed on Page 23 Exercise 1.3. #1. a. Apply this algorithm to sorting the list 15, 65, 81, 39, 65, 21, 42, 23 b. Is this algorithm stable? c. Is it in-place? ALGORITHM Comparison Counting Sort(A[O... - 1]) //Sorts an array by comparison counting l/Input: Array A[0..11 1] of orderable values I/Output: Array S[O... - 1] of A's elements sorted Il in nondecreasing order for i