a) This is used to compute minimum element in the array A starting from the

a) This is used to scold poverty atom in the place A starting from the apostacy p to apostacy r. Variables temp and temp2 are takes to the employment by recursive calls, and the place is divided into half until undivided poverty atom is left to be repayed by the algorithm.

b) Reappearance pertinency is attached by, T(n)=2T(n/2)

Let us affect that place A as 2^{k} elements and k is an integer, k>1, and n=2^{k}

if k=1, ten n=2 and t(n)=2

By using induction

T(2^{k})=2^{k},

then

2(^{k+1)}=T(n=2^{(k+1)})

=2T(2^{k})

=2.2^{k}

=2^{(k+1)}

Since it applies ce k+1, it as-well applied ce entire k

Therefore

T(n)=n