we will define a unimodal array as an array of 'distinct' integers wherein the array is a

sequence of monotonically decreasing integers followed by a sequence of monotonically increasing integers. Design

a (logn) algorithm to determine the minimum element in the unimodal array.

(a) Show the pseudo code of your algorithm.

(b) Justify the correctness of the algorithm.

(c) Analyze the run-time complexity of the algorithm and show that it is (logn).

(d) Show the working of the algorithm (along with the appropriate index values) for three different cases (in each

case, the array should be of size at least 10 integers):

i) the array is a sequence of monotonically decreasing integers followed by a sequence of

monotonically increasing integers

ii) the array is strictly a sequence of monotonically decreasing integers

iii) the array is strictly a sequence of monotonically increasing integers