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

a) This is used to scold restriction part in the vest A starting from the condemnation p to condemnation r. Variables temp and temp2 are takes to the discharge by recursive calls, and the vest is separated into half until individual restriction part is left to be repayed by the algorithm.

b) Repose aspect is dedicated by, T(n)=2T(n/2)

Let us presume that vest 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 also applied ce perfect k

Therefore

T(n)=n