ANSWER 1. The maximum and the minimum value from a list can be easily calculated by calling recursive procedure again and again on the smallest sub-problems that are generated by dividing the given list at its mid-point to reach a single element at the bottom.

Here I provide you with a link showing its working C code click here

ANSWER 2. The solution to this problem is already provided in the Divide and Conquer Method Example. click here

ANSWER 3. This question is already discussed in between the lesson plan (Theory about Divide and Conquer Method) click here

ANSWER 4. This is the method that is used for matrix multiplications and was proposed by Strassen. It is not important, but just for some extra knowledge you can visit to this wikipedia link click here.

Non-profit Tax ID # 203478467