1. Design algorithm int BinarySearch_Des(int L[], int n, int k) that finds and returns the index of k in L sorted in descending order. If k is not found, -1 is returned. For example, given array

int D[12] = {120, 110, 100, 90, 80, 70 , 60, 50, 40, 30, 20, 10}; sorted in desscending order. The call: BinarySearch_ Asc (D, 12, 70); should return 5 (index of 70 in the above array D).

The call: BinarySearch_ Asc (D, 12, 25); should return -1(not found).