Give a divide and conquer based algorithm (Write a pseudo-code) to perform following:

     Give a divide and conquer based algorithm (Write a  pseudo-code)  to perform following:
  (i)  find the is smallest element in an array of size. Derive the  running time complexity of your                 algorithm.
  (ii)  finding the position of an element in an array of n numbers  Estimate the number of key                    comparisons made by youralgorithms