1. Searching sequentially a sorted array with duplicate items.

   1. Design algorithm int SearchSorted_Asc_Du(int L[], int n, int k) that finds and returns the index of the first occurrence of k in L sorted in ascending order. If k is not found, -1 is returned. For example, given array int F[10] = {20, 30, 30, 50, 60, 60 , 60, 90, 100, 110}; sorted in ascending order. The call SearchSorted_ Asc_Du(F, 10, 60); should return 4 (index of the first occurrence of 60 in the above array F).

The call: SearchSorted_ Asc_Du (F, 10, 55); should return -1(not found).

2. Design algorithm int SearchSorted_Des_Du(int L[], int n, int k) that finds and returns the index of the last occurrence of k in L sorted in descending order. If k is not found, -1 is returned. For example, given array int G[12] = {120, 110, 110, 110, 80, 70 , 70, 50, 40, 30, 30, 30}; sorted in descending order. The call SearchSorted_ Dec_Du(G, 12, 70); should return 6 (index of the last occurrence of 90 in the above array G).

The call: SearchSorted_ Dec_Du(G, 12, 10); should return -1(not found).